TSTP Solution File: SEU267+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU267+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:40:15 EDT 2022
% Result : Theorem 8.99s 2.89s
% Output : CNFRefutation 8.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 34 ( 33 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_110,plain,
( X1 = X2
| X1 != pair_second(X3)
| X3 != unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4))
| X3 != unordered_pair(unordered_pair(X6,X2),unordered_pair(X6,X6)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a9bn98di/lgb.p',i_0_110) ).
cnf(i_0_74,plain,
( X1 = X2
| X1 != pair_first(X3)
| X3 != unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4))
| X3 != unordered_pair(unordered_pair(X2,X6),unordered_pair(X2,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a9bn98di/lgb.p',i_0_74) ).
cnf(i_0_659,negated_conjecture,
( pair_first(unordered_pair(unordered_pair(esk131_0,esk132_0),unordered_pair(esk131_0,esk131_0))) != esk131_0
| pair_second(unordered_pair(unordered_pair(esk131_0,esk132_0),unordered_pair(esk131_0,esk131_0))) != esk132_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a9bn98di/lgb.p',i_0_659) ).
cnf(i_0_15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a9bn98di/lgb.p',i_0_15) ).
cnf(c_0_664,plain,
( X1 = X2
| X1 != pair_second(X3)
| X3 != unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4))
| X3 != unordered_pair(unordered_pair(X6,X2),unordered_pair(X6,X6)) ),
i_0_110 ).
cnf(c_0_665,plain,
( pair_second(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))) = X2
| unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)) != unordered_pair(unordered_pair(X3,X4),unordered_pair(X3,X3)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_664])]) ).
cnf(c_0_666,plain,
( X1 = X2
| X1 != pair_first(X3)
| X3 != unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4))
| X3 != unordered_pair(unordered_pair(X2,X6),unordered_pair(X2,X2)) ),
i_0_74 ).
cnf(c_0_667,negated_conjecture,
( pair_first(unordered_pair(unordered_pair(esk131_0,esk132_0),unordered_pair(esk131_0,esk131_0))) != esk131_0
| pair_second(unordered_pair(unordered_pair(esk131_0,esk132_0),unordered_pair(esk131_0,esk131_0))) != esk132_0 ),
i_0_659 ).
cnf(c_0_668,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_15 ).
cnf(c_0_669,plain,
pair_second(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))) = X2,
inference(er,[status(thm)],[c_0_665]) ).
cnf(c_0_670,plain,
( pair_first(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))) = X3
| unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)) != unordered_pair(unordered_pair(X3,X4),unordered_pair(X3,X3)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_666])]) ).
cnf(c_0_671,negated_conjecture,
( pair_first(unordered_pair(unordered_pair(esk131_0,esk131_0),unordered_pair(esk131_0,esk132_0))) != esk131_0
| pair_second(unordered_pair(unordered_pair(esk131_0,esk131_0),unordered_pair(esk131_0,esk132_0))) != esk132_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_667,c_0_668]),c_0_668]) ).
cnf(c_0_672,plain,
pair_second(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_669,c_0_668]) ).
cnf(c_0_673,plain,
pair_first(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))) = X1,
inference(er,[status(thm)],[c_0_670]) ).
cnf(c_0_674,negated_conjecture,
pair_first(unordered_pair(unordered_pair(esk131_0,esk131_0),unordered_pair(esk131_0,esk132_0))) != esk131_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_671,c_0_672])]) ).
cnf(c_0_675,plain,
pair_first(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2))) = X1,
inference(spm,[status(thm)],[c_0_673,c_0_668]) ).
cnf(c_0_676,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_674,c_0_675])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU267+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 19 21:53:09 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.99/2.89 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.99/2.89 # No SInE strategy applied
% 8.99/2.89 # Trying AutoSched0 for 150 seconds
% 8.99/2.89 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S032I
% 8.99/2.89 # and selection function SelectUnlessUniqMax.
% 8.99/2.89 #
% 8.99/2.89 # Preprocessing time : 0.024 s
% 8.99/2.89 # Presaturation interreduction done
% 8.99/2.89
% 8.99/2.89 # Proof found!
% 8.99/2.89 # SZS status Theorem
% 8.99/2.89 # SZS output start CNFRefutation
% See solution above
% 8.99/2.89 # Training examples: 0 positive, 0 negative
% 8.99/2.89
% 8.99/2.89 # -------------------------------------------------
% 8.99/2.89 # User time : 0.052 s
% 8.99/2.89 # System time : 0.008 s
% 8.99/2.89 # Total time : 0.059 s
% 8.99/2.90 # Maximum resident set size: 7124 pages
% 8.99/2.90
%------------------------------------------------------------------------------