TSTP Solution File: SYN726+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN726+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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 : Thu Jul 21 04:56:45 EDT 2022
% Result : Theorem 4.46s 2.24s
% Output : CNFRefutation 4.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 12 unt; 6 nHn; 19 RR)
% Number of literals : 60 ( 0 equ; 29 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 42 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( p(X1,X2)
| ~ epred1_0
| ~ p(X3,X2)
| ~ p(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h8pkkw2/lgb.p',i_0_7) ).
cnf(i_0_3,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h8pkkw2/lgb.p',i_0_3) ).
cnf(i_0_4,plain,
( p(X1,X2)
| q(X1,X2)
| ~ epred1_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h8pkkw2/lgb.p',i_0_4) ).
cnf(i_0_5,plain,
( q(X1,X2)
| ~ epred1_0
| ~ q(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h8pkkw2/lgb.p',i_0_5) ).
cnf(i_0_2,negated_conjecture,
~ p(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h8pkkw2/lgb.p',i_0_2) ).
cnf(i_0_6,plain,
( q(X1,X2)
| ~ epred1_0
| ~ q(X3,X2)
| ~ q(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h8pkkw2/lgb.p',i_0_6) ).
cnf(i_0_1,negated_conjecture,
~ q(esk3_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h8pkkw2/lgb.p',i_0_1) ).
cnf(c_0_15,plain,
( p(X1,X2)
| ~ epred1_0
| ~ p(X3,X2)
| ~ p(X1,X3) ),
i_0_7 ).
cnf(c_0_16,negated_conjecture,
epred1_0,
i_0_3 ).
cnf(c_0_17,plain,
( p(X1,X2)
| q(X1,X2)
| ~ epred1_0 ),
i_0_4 ).
cnf(c_0_18,plain,
( p(X1,X2)
| ~ p(X3,X2)
| ~ p(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_19,plain,
( q(X1,X2)
| p(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16])]) ).
cnf(c_0_20,plain,
( q(X1,X2)
| ~ epred1_0
| ~ q(X2,X1) ),
i_0_5 ).
cnf(c_0_21,negated_conjecture,
~ p(esk1_0,esk2_0),
i_0_2 ).
cnf(c_0_22,plain,
( q(X1,X2)
| p(X3,X2)
| ~ p(X3,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( q(X1,X2)
| ~ epred1_0
| ~ q(X3,X2)
| ~ q(X1,X3) ),
i_0_6 ).
cnf(c_0_24,plain,
( q(X1,X2)
| ~ q(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_16])]) ).
cnf(c_0_25,negated_conjecture,
q(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_26,plain,
( q(X1,X2)
| q(X2,X3)
| p(X1,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_27,plain,
( q(X1,X2)
| ~ q(X3,X2)
| ~ q(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_16])]) ).
cnf(c_0_28,plain,
q(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( q(X1,esk2_0)
| q(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_30,plain,
( q(X1,esk1_0)
| ~ q(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
q(X1,esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_30]) ).
cnf(c_0_32,plain,
q(esk1_0,X1),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
~ q(esk3_0,esk4_0),
i_0_1 ).
cnf(c_0_34,plain,
q(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_32]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN726+1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n016.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 : Tue Jul 12 03:39:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.40 # ENIGMATIC: Selected complete mode:
% 4.46/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.46/2.24 # No SInE strategy applied
% 4.46/2.24 # Trying AutoSched0 for 150 seconds
% 4.46/2.24 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 4.46/2.24 # and selection function SelectNewComplexAHP.
% 4.46/2.24 #
% 4.46/2.24 # Preprocessing time : 0.022 s
% 4.46/2.24 # Presaturation interreduction done
% 4.46/2.24
% 4.46/2.24 # Proof found!
% 4.46/2.24 # SZS status Theorem
% 4.46/2.24 # SZS output start CNFRefutation
% See solution above
% 4.46/2.24 # Training examples: 0 positive, 0 negative
% 4.46/2.24
% 4.46/2.24 # -------------------------------------------------
% 4.46/2.24 # User time : 0.022 s
% 4.46/2.24 # System time : 0.010 s
% 4.46/2.24 # Total time : 0.032 s
% 4.46/2.24 # Maximum resident set size: 7124 pages
% 4.46/2.24
%------------------------------------------------------------------------------