TSTP Solution File: PUZ129+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 18:08:47 EDT 2022
% Result : Theorem 6.73s 2.20s
% Output : CNFRefutation 6.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 18 unt; 0 nHn; 45 RR)
% Number of literals : 110 ( 20 equ; 69 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
( esk5_1(X1) = X1
| ~ epred1_0
| ~ cyclist(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_13) ).
cnf(i_0_4,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_4) ).
cnf(i_0_14,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ epred1_0
| ~ cyclist(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_14) ).
cnf(i_0_2,negated_conjecture,
cyclist(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_2) ).
cnf(i_0_7,plain,
( esk7_1(X1) = X1
| ~ epred1_0
| ~ grocer(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_7) ).
cnf(i_0_3,negated_conjecture,
grocer(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
esk2_0 = esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_1) ).
cnf(i_0_15,plain,
( esk4_1(X1) = X1
| ~ epred1_0
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_15) ).
cnf(i_0_8,plain,
( person(esk7_1(X1))
| ~ epred1_0
| ~ grocer(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_8) ).
cnf(i_0_16,plain,
( property1(esk4_1(X1),honest,pos)
| ~ epred1_0
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_16) ).
cnf(i_0_18,plain,
( esk3_1(X1) = X1
| ~ epred1_0
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_18) ).
cnf(i_0_17,plain,
( X1 != X2
| ~ epred1_0
| ~ grocer(X1)
| ~ property1(X2,healthy,pos) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_17) ).
cnf(i_0_19,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ epred1_0
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t8x5yeww/lgb.p',i_0_19) ).
cnf(c_0_33,plain,
( esk5_1(X1) = X1
| ~ epred1_0
| ~ cyclist(X1) ),
i_0_13 ).
cnf(c_0_34,negated_conjecture,
epred1_0,
i_0_4 ).
cnf(c_0_35,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ epred1_0
| ~ cyclist(X1) ),
i_0_14 ).
cnf(c_0_36,plain,
( esk5_1(X1) = X1
| ~ cyclist(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
cyclist(esk2_0),
i_0_2 ).
cnf(c_0_38,plain,
( esk7_1(X1) = X1
| ~ epred1_0
| ~ grocer(X1) ),
i_0_7 ).
cnf(c_0_39,negated_conjecture,
grocer(esk1_0),
i_0_3 ).
cnf(c_0_40,negated_conjecture,
esk2_0 = esk1_0,
i_0_1 ).
cnf(c_0_41,plain,
( esk4_1(X1) = X1
| ~ epred1_0
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
i_0_15 ).
cnf(c_0_42,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ cyclist(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_34])]) ).
cnf(c_0_43,negated_conjecture,
esk5_1(esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
( person(esk7_1(X1))
| ~ epred1_0
| ~ grocer(X1) ),
i_0_8 ).
cnf(c_0_45,plain,
( esk7_1(X1) = X1
| ~ grocer(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_34])]) ).
cnf(c_0_46,negated_conjecture,
grocer(esk2_0),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
( property1(esk4_1(X1),honest,pos)
| ~ epred1_0
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
i_0_16 ).
cnf(c_0_48,plain,
( esk4_1(X1) = X1
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_34])]) ).
cnf(c_0_49,negated_conjecture,
property1(esk2_0,industrious,pos),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_37]),c_0_43]) ).
cnf(c_0_50,plain,
( esk3_1(X1) = X1
| ~ epred1_0
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
i_0_18 ).
cnf(c_0_51,plain,
( person(esk7_1(X1))
| ~ grocer(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_34])]) ).
cnf(c_0_52,negated_conjecture,
esk7_1(esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
( property1(esk4_1(X1),honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_34])]) ).
cnf(c_0_54,negated_conjecture,
esk4_1(esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_49])]) ).
cnf(c_0_55,plain,
( X1 != X2
| ~ epred1_0
| ~ grocer(X1)
| ~ property1(X2,healthy,pos) ),
i_0_17 ).
cnf(c_0_56,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ epred1_0
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
i_0_19 ).
cnf(c_0_57,plain,
( esk3_1(X1) = X1
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_34])]) ).
cnf(c_0_58,negated_conjecture,
person(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_46])]) ).
cnf(c_0_59,negated_conjecture,
property1(esk2_0,honest,pos),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_54]),c_0_49])]) ).
cnf(c_0_60,plain,
( ~ grocer(X1)
| ~ property1(X1,healthy,pos) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_34])])]) ).
cnf(c_0_61,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_34])]) ).
cnf(c_0_62,negated_conjecture,
esk3_1(esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_49])]) ).
cnf(c_0_63,negated_conjecture,
~ property1(esk2_0,healthy,pos),
inference(spm,[status(thm)],[c_0_60,c_0_46]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_58]),c_0_62]),c_0_59]),c_0_49])]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat May 28 21:25:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.73/2.20 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.73/2.20 # No SInE strategy applied
% 6.73/2.20 # Trying AutoSched0 for 150 seconds
% 6.73/2.20 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AI
% 6.73/2.20 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.73/2.20 #
% 6.73/2.20 # Preprocessing time : 0.013 s
% 6.73/2.20 # Presaturation interreduction done
% 6.73/2.20
% 6.73/2.20 # Proof found!
% 6.73/2.20 # SZS status Theorem
% 6.73/2.20 # SZS output start CNFRefutation
% See solution above
% 6.73/2.20 # Training examples: 0 positive, 0 negative
% 6.73/2.20
% 6.73/2.20 # -------------------------------------------------
% 6.73/2.20 # User time : 0.016 s
% 6.73/2.20 # System time : 0.003 s
% 6.73/2.20 # Total time : 0.019 s
% 6.73/2.20 # Maximum resident set size: 7124 pages
% 6.73/2.20
%------------------------------------------------------------------------------