TSTP Solution File: COM007+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM007+2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 : Fri Jul 15 01:06:53 EDT 2022
% Result : Theorem 7.56s 2.31s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 15 unt; 5 nHn; 32 RR)
% Number of literals : 59 ( 6 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( goal
| ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_3) ).
cnf(i_0_9,negated_conjecture,
~ goal,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_9) ).
cnf(i_0_4,plain,
( reflexive_rewrite(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_4) ).
cnf(i_0_6,plain,
( X1 = X2
| rewrite(X1,X2)
| ~ reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_6) ).
cnf(i_0_1,plain,
reflexive_rewrite(a,c),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_1) ).
cnf(i_0_2,plain,
reflexive_rewrite(a,b),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_2) ).
cnf(i_0_8,plain,
( rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_8) ).
cnf(i_0_7,plain,
( rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_7) ).
cnf(i_0_5,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4muom8ci/input.p',i_0_5) ).
cnf(c_0_19,plain,
( goal
| ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
i_0_3 ).
cnf(c_0_20,negated_conjecture,
~ goal,
i_0_9 ).
cnf(c_0_21,plain,
( reflexive_rewrite(X1,X2)
| X1 != X2 ),
i_0_4 ).
cnf(c_0_22,plain,
( ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
reflexive_rewrite(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( X1 = X2
| rewrite(X1,X2)
| ~ reflexive_rewrite(X1,X2) ),
i_0_6 ).
cnf(c_0_25,plain,
reflexive_rewrite(a,c),
i_0_1 ).
cnf(c_0_26,plain,
reflexive_rewrite(a,b),
i_0_2 ).
cnf(c_0_27,plain,
~ reflexive_rewrite(c,b),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( c = a
| rewrite(a,c) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( a = b
| rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_30,plain,
( rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
i_0_8 ).
cnf(c_0_31,plain,
rewrite(a,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26])]) ).
cnf(c_0_32,plain,
( rewrite(a,b)
| reflexive_rewrite(b,c) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_33,plain,
( rewrite(X1,esk1_3(a,X1,c))
| ~ rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
rewrite(a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_23])]) ).
cnf(c_0_35,plain,
( rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
i_0_7 ).
cnf(c_0_36,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
i_0_5 ).
cnf(c_0_37,plain,
rewrite(b,esk1_3(a,b,c)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( rewrite(X1,esk1_3(a,b,X1))
| ~ rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_39,plain,
reflexive_rewrite(b,esk1_3(a,b,c)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
rewrite(c,esk1_3(a,b,c)),
inference(spm,[status(thm)],[c_0_38,c_0_31]) ).
cnf(c_0_41,plain,
~ reflexive_rewrite(c,esk1_3(a,b,c)),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COM007+2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 17:35:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.56/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.56/2.31 # No SInE strategy applied
% 7.56/2.31 # Trying AutoSched0 for 150 seconds
% 7.56/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S076A
% 7.56/2.31 # and selection function SelectCQIAr.
% 7.56/2.31 #
% 7.56/2.31 # Preprocessing time : 0.023 s
% 7.56/2.31 # Presaturation interreduction done
% 7.56/2.31
% 7.56/2.31 # Proof found!
% 7.56/2.31 # SZS status Theorem
% 7.56/2.31 # SZS output start CNFRefutation
% See solution above
% 7.56/2.31 # Training examples: 0 positive, 0 negative
% 7.56/2.31
% 7.56/2.31 # -------------------------------------------------
% 7.56/2.31 # User time : 0.020 s
% 7.56/2.31 # System time : 0.011 s
% 7.56/2.31 # Total time : 0.032 s
% 7.56/2.31 # Maximum resident set size: 7116 pages
% 7.56/2.31
%------------------------------------------------------------------------------