TSTP Solution File: SET918+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET918+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 00:15:14 EDT 2022
% Result : Theorem 7.65s 2.45s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 19 RR)
% Number of literals : 45 ( 22 equ; 23 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,negated_conjecture,
set_intersection2(unordered_pair(esk6_0,esk7_0),esk8_0) = singleton(esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2_z8phu/lgb.p',i_0_25) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2_z8phu/lgb.p',i_0_2) ).
cnf(i_0_17,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2_z8phu/lgb.p',i_0_17) ).
cnf(i_0_3,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2_z8phu/lgb.p',i_0_3) ).
cnf(i_0_7,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2_z8phu/lgb.p',i_0_7) ).
cnf(i_0_12,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2_z8phu/lgb.p',i_0_12) ).
cnf(i_0_24,negated_conjecture,
in(esk7_0,esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2_z8phu/lgb.p',i_0_24) ).
cnf(i_0_23,negated_conjecture,
esk6_0 != esk7_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2_z8phu/lgb.p',i_0_23) ).
cnf(c_0_34,negated_conjecture,
set_intersection2(unordered_pair(esk6_0,esk7_0),esk8_0) = singleton(esk6_0),
i_0_25 ).
cnf(c_0_35,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_36,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_17 ).
cnf(c_0_37,negated_conjecture,
set_intersection2(unordered_pair(esk7_0,esk6_0),esk8_0) = singleton(esk6_0),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_3 ).
cnf(c_0_39,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_7 ).
cnf(c_0_40,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
set_intersection2(esk8_0,unordered_pair(esk7_0,esk6_0)) = singleton(esk6_0),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( in(X1,singleton(esk6_0))
| ~ in(X1,unordered_pair(esk7_0,esk6_0))
| ~ in(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
i_0_12 ).
cnf(c_0_45,plain,
( X1 = esk6_0
| ~ in(X1,unordered_pair(esk7_0,esk6_0))
| ~ in(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
in(esk7_0,esk8_0),
i_0_24 ).
cnf(c_0_48,negated_conjecture,
esk6_0 != esk7_0,
i_0_23 ).
cnf(c_0_49,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET918+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 Jul 10 22:55:02 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected complete mode:
% 7.65/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.65/2.45 # No SInE strategy applied
% 7.65/2.45 # Trying AutoSched0 for 150 seconds
% 7.65/2.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.65/2.45 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.65/2.45 #
% 7.65/2.45 # Preprocessing time : 0.012 s
% 7.65/2.45 # Presaturation interreduction done
% 7.65/2.45
% 7.65/2.45 # Proof found!
% 7.65/2.45 # SZS status Theorem
% 7.65/2.45 # SZS output start CNFRefutation
% See solution above
% 7.65/2.45 # Training examples: 0 positive, 0 negative
% 7.65/2.45
% 7.65/2.45 # -------------------------------------------------
% 7.65/2.45 # User time : 0.014 s
% 7.65/2.45 # System time : 0.004 s
% 7.65/2.45 # Total time : 0.018 s
% 7.65/2.45 # Maximum resident set size: 7120 pages
% 7.65/2.45
%------------------------------------------------------------------------------