TSTP Solution File: SEU151+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU151+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 : Tue Jul 19 08:38:54 EDT 2022
% Result : Theorem 8.00s 2.42s
% Output : CNFRefutation 8.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 15 unt; 3 nHn; 21 RR)
% Number of literals : 40 ( 27 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-um184nxn/lgb.p',i_0_6) ).
cnf(i_0_8,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-um184nxn/lgb.p',i_0_8) ).
cnf(i_0_13,negated_conjecture,
unordered_pair(esk4_0,esk5_0) = unordered_pair(esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-um184nxn/lgb.p',i_0_13) ).
cnf(i_0_11,negated_conjecture,
esk4_0 != esk7_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-um184nxn/lgb.p',i_0_11) ).
cnf(i_0_7,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-um184nxn/lgb.p',i_0_7) ).
cnf(i_0_12,negated_conjecture,
esk4_0 != esk6_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-um184nxn/lgb.p',i_0_12) ).
cnf(c_0_20,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
i_0_6 ).
cnf(c_0_21,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
i_0_8 ).
cnf(c_0_22,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
unordered_pair(esk4_0,esk5_0) = unordered_pair(esk6_0,esk7_0),
i_0_13 ).
cnf(c_0_24,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X2,X3)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
in(esk7_0,unordered_pair(esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
esk4_0 != esk7_0,
i_0_11 ).
cnf(c_0_27,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
i_0_7 ).
cnf(c_0_28,negated_conjecture,
esk5_0 = esk7_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
unordered_pair(esk6_0,esk7_0) = unordered_pair(esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_31,plain,
in(esk6_0,unordered_pair(esk4_0,esk7_0)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
esk4_0 != esk6_0,
i_0_12 ).
cnf(c_0_33,plain,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_31]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
unordered_pair(esk6_0,esk6_0) = unordered_pair(esk4_0,esk6_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_33]),c_0_33]) ).
cnf(c_0_35,plain,
( X1 = esk6_0
| ~ in(X1,unordered_pair(esk4_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_34]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU151+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n022.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 22:23:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.00/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.00/2.42 # No SInE strategy applied
% 8.00/2.42 # Trying AutoSched0 for 150 seconds
% 8.00/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S03DI
% 8.00/2.42 # and selection function PSelectComplexExceptRRHorn.
% 8.00/2.42 #
% 8.00/2.42 # Preprocessing time : 0.013 s
% 8.00/2.42 # Presaturation interreduction done
% 8.00/2.42
% 8.00/2.42 # Proof found!
% 8.00/2.42 # SZS status Theorem
% 8.00/2.42 # SZS output start CNFRefutation
% See solution above
% 8.00/2.42 # Training examples: 0 positive, 0 negative
% 8.00/2.42
% 8.00/2.42 # -------------------------------------------------
% 8.00/2.42 # User time : 0.013 s
% 8.00/2.42 # System time : 0.004 s
% 8.00/2.42 # Total time : 0.016 s
% 8.00/2.42 # Maximum resident set size: 7128 pages
% 8.00/2.42
%------------------------------------------------------------------------------