TSTP Solution File: COM007+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM007+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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.57s 2.32s
% Output : CNFRefutation 7.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 43 ( 13 unt; 11 nHn; 40 RR)
% Number of literals : 88 ( 0 equ; 38 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( equalish(X1,X2)
| rewrite(X1,X2)
| ~ reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_9) ).
cnf(i_0_2,plain,
reflexive_rewrite(a,b),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_2) ).
cnf(i_0_5,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_5) ).
cnf(i_0_3,plain,
( goal
| ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_3) ).
cnf(i_0_12,negated_conjecture,
~ goal,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_12) ).
cnf(i_0_7,plain,
( reflexive_rewrite(X1,X2)
| ~ equalish(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_7) ).
cnf(i_0_4,plain,
equalish(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_4) ).
cnf(i_0_1,plain,
reflexive_rewrite(a,c),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_1) ).
cnf(i_0_6,plain,
( reflexive_rewrite(X1,X2)
| ~ reflexive_rewrite(X3,X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_6) ).
cnf(i_0_8,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_8) ).
cnf(i_0_11,plain,
( rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_11) ).
cnf(i_0_10,plain,
( rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-56p08ogb/lgb.p',i_0_10) ).
cnf(c_0_25,plain,
( equalish(X1,X2)
| rewrite(X1,X2)
| ~ reflexive_rewrite(X1,X2) ),
i_0_9 ).
cnf(c_0_26,plain,
reflexive_rewrite(a,b),
i_0_2 ).
cnf(c_0_27,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
i_0_5 ).
cnf(c_0_28,plain,
( equalish(a,b)
| rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( goal
| ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
i_0_3 ).
cnf(c_0_30,negated_conjecture,
~ goal,
i_0_12 ).
cnf(c_0_31,plain,
( reflexive_rewrite(X1,X2)
| ~ equalish(X1,X2) ),
i_0_7 ).
cnf(c_0_32,plain,
equalish(X1,X1),
i_0_4 ).
cnf(c_0_33,plain,
reflexive_rewrite(a,c),
i_0_1 ).
cnf(c_0_34,plain,
( reflexive_rewrite(X1,X2)
| ~ reflexive_rewrite(X3,X2)
| ~ equalish(X1,X3) ),
i_0_6 ).
cnf(c_0_35,plain,
( equalish(b,a)
| rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
reflexive_rewrite(X1,X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( equalish(a,c)
| rewrite(a,c) ),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_39,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
i_0_8 ).
cnf(c_0_40,plain,
( rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
i_0_11 ).
cnf(c_0_41,plain,
( rewrite(a,b)
| reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
~ reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( equalish(c,a)
| rewrite(a,c) ),
inference(spm,[status(thm)],[c_0_27,c_0_38]) ).
cnf(c_0_44,plain,
( reflexive_rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
rewrite(a,b),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_42]) ).
cnf(c_0_46,plain,
( rewrite(a,c)
| reflexive_rewrite(c,X1)
| ~ reflexive_rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_43]) ).
cnf(c_0_47,plain,
( rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
i_0_10 ).
cnf(c_0_48,plain,
( reflexive_rewrite(X1,esk1_3(a,X1,b))
| ~ rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( rewrite(a,c)
| reflexive_rewrite(c,b) ),
inference(spm,[status(thm)],[c_0_46,c_0_26]) ).
cnf(c_0_50,plain,
( reflexive_rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_47]) ).
cnf(c_0_51,plain,
( reflexive_rewrite(c,esk1_3(a,c,b))
| reflexive_rewrite(c,b) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
( reflexive_rewrite(X1,esk1_3(a,c,X1))
| reflexive_rewrite(c,b)
| ~ rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_53,plain,
( reflexive_rewrite(c,b)
| ~ reflexive_rewrite(b,esk1_3(a,c,b)) ),
inference(spm,[status(thm)],[c_0_36,c_0_51]) ).
cnf(c_0_54,plain,
reflexive_rewrite(c,b),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_45]),c_0_53]) ).
cnf(c_0_55,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_54]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM007+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 19:54:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.57/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.57/2.32 # No SInE strategy applied
% 7.57/2.32 # Trying AutoSched0 for 150 seconds
% 7.57/2.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AA
% 7.57/2.32 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.57/2.32 #
% 7.57/2.32 # Preprocessing time : 0.023 s
% 7.57/2.32 # Presaturation interreduction done
% 7.57/2.32
% 7.57/2.32 # Proof found!
% 7.57/2.32 # SZS status Theorem
% 7.57/2.32 # SZS output start CNFRefutation
% See solution above
% 7.57/2.32 # Training examples: 0 positive, 0 negative
% 7.57/2.32
% 7.57/2.32 # -------------------------------------------------
% 7.57/2.32 # User time : 0.023 s
% 7.57/2.32 # System time : 0.009 s
% 7.57/2.32 # Total time : 0.033 s
% 7.57/2.32 # Maximum resident set size: 7124 pages
% 7.57/2.32
%------------------------------------------------------------------------------