TSTP Solution File: SEU156+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU156+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:57 EDT 2022
% Result : Theorem 7.60s 2.45s
% Output : CNFRefutation 7.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of clauses : 39 ( 15 unt; 12 nHn; 35 RR)
% Number of literals : 72 ( 66 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 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 : 49 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
unordered_pair(unordered_pair(esk3_0,esk4_0),unordered_pair(esk3_0,esk3_0)) = unordered_pair(unordered_pair(esk5_0,esk6_0),unordered_pair(esk5_0,esk5_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d9kem8t1/lgb.p',i_0_12) ).
cnf(i_0_1,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d9kem8t1/lgb.p',i_0_1) ).
cnf(i_0_10,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d9kem8t1/lgb.p',i_0_10) ).
cnf(i_0_16,plain,
( X1 = X2
| unordered_pair(X3,X3) != unordered_pair(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d9kem8t1/lgb.p',i_0_16) ).
cnf(i_0_14,plain,
( X1 = X2
| ~ subset(unordered_pair(X1,X1),unordered_pair(X2,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d9kem8t1/lgb.p',i_0_14) ).
cnf(i_0_9,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d9kem8t1/lgb.p',i_0_9) ).
cnf(i_0_15,plain,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d9kem8t1/lgb.p',i_0_15) ).
cnf(i_0_11,negated_conjecture,
( esk3_0 != esk5_0
| esk4_0 != esk6_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d9kem8t1/lgb.p',i_0_11) ).
cnf(c_0_25,negated_conjecture,
unordered_pair(unordered_pair(esk3_0,esk4_0),unordered_pair(esk3_0,esk3_0)) = unordered_pair(unordered_pair(esk5_0,esk6_0),unordered_pair(esk5_0,esk5_0)),
i_0_12 ).
cnf(c_0_26,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_1 ).
cnf(c_0_27,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
i_0_10 ).
cnf(c_0_28,negated_conjecture,
unordered_pair(unordered_pair(esk3_0,esk3_0),unordered_pair(esk3_0,esk4_0)) = unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( X1 = unordered_pair(esk3_0,esk4_0)
| X1 = unordered_pair(esk3_0,esk3_0)
| unordered_pair(X1,X2) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( X1 = X2
| unordered_pair(X3,X3) != unordered_pair(X1,X2) ),
i_0_16 ).
cnf(c_0_31,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk5_0)
| unordered_pair(esk3_0,esk4_0) = unordered_pair(esk5_0,esk5_0) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk5_0)
| esk4_0 = esk3_0
| unordered_pair(esk5_0,esk5_0) != unordered_pair(X1,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ subset(unordered_pair(X1,X1),unordered_pair(X2,X2)) ),
i_0_14 ).
cnf(c_0_34,plain,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk5_0)
| esk4_0 = esk3_0 ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_35,plain,
( esk4_0 = esk3_0
| esk3_0 = X1
| ~ subset(unordered_pair(esk5_0,esk5_0),unordered_pair(X1,X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
subset(X1,X1),
i_0_9 ).
cnf(c_0_37,plain,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
i_0_15 ).
cnf(c_0_38,plain,
( esk3_0 = esk5_0
| esk4_0 = esk3_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_26]) ).
cnf(c_0_40,negated_conjecture,
esk3_0 = esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_38]),c_0_39]) ).
cnf(c_0_41,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X4,X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_42,negated_conjecture,
unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk4_0)) = unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_40]),c_0_40]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( X1 = unordered_pair(esk5_0,esk5_0)
| X1 = unordered_pair(esk5_0,esk4_0)
| unordered_pair(X2,X1) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk5_0,esk6_0) = unordered_pair(esk5_0,esk5_0) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_45,negated_conjecture,
( esk3_0 != esk5_0
| esk4_0 != esk6_0 ),
i_0_11 ).
cnf(c_0_46,negated_conjecture,
( X1 = unordered_pair(esk3_0,esk4_0)
| unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_47,plain,
( unordered_pair(esk5_0,esk6_0) = unordered_pair(esk5_0,esk5_0)
| X1 = esk5_0
| X1 = esk4_0
| unordered_pair(X2,X1) != unordered_pair(esk5_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
esk4_0 != esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_40])]) ).
cnf(c_0_49,negated_conjecture,
( X1 = unordered_pair(esk5_0,esk4_0)
| unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)) ),
inference(rw,[status(thm)],[c_0_46,c_0_40]) ).
cnf(c_0_50,plain,
esk6_0 = esk5_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_48]),c_0_39]) ).
cnf(c_0_51,negated_conjecture,
( X1 = unordered_pair(esk5_0,esk4_0)
| unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk5_0)) ),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,negated_conjecture,
unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk5_0),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_53,negated_conjecture,
esk4_0 != esk5_0,
inference(rw,[status(thm)],[c_0_48,c_0_50]) ).
cnf(c_0_54,plain,
unordered_pair(esk5_0,esk5_0) != unordered_pair(X1,X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_52]),c_0_53]) ).
cnf(c_0_55,plain,
$false,
inference(er,[status(thm)],[c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU156+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 20 01:15:16 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected complete mode:
% 7.60/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.60/2.45 # No SInE strategy applied
% 7.60/2.45 # Trying AutoSched0 for 150 seconds
% 7.60/2.45 # AutoSched0-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN
% 7.60/2.45 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.60/2.45 #
% 7.60/2.45 # Preprocessing time : 0.012 s
% 7.60/2.45 # Presaturation interreduction done
% 7.60/2.45
% 7.60/2.45 # Proof found!
% 7.60/2.45 # SZS status Theorem
% 7.60/2.45 # SZS output start CNFRefutation
% See solution above
% 7.60/2.45 # Training examples: 0 positive, 0 negative
% 7.60/2.45
% 7.60/2.45 # -------------------------------------------------
% 7.60/2.45 # User time : 0.014 s
% 7.60/2.45 # System time : 0.007 s
% 7.60/2.45 # Total time : 0.021 s
% 7.60/2.45 # Maximum resident set size: 7128 pages
% 7.60/2.45
%------------------------------------------------------------------------------