TSTP Solution File: SET903+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET903+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:07 EDT 2022
% Result : Theorem 7.25s 2.28s
% Output : CNFRefutation 7.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 11 unt; 4 nHn; 17 RR)
% Number of literals : 27 ( 26 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = empty_set
| X1 = singleton(X2)
| singleton(X2) != set_union2(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zhvqu7cv/lgb.p',i_0_8) ).
cnf(i_0_19,negated_conjecture,
set_union2(esk4_0,esk5_0) = singleton(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zhvqu7cv/lgb.p',i_0_19) ).
cnf(i_0_16,negated_conjecture,
esk5_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zhvqu7cv/lgb.p',i_0_16) ).
cnf(i_0_15,plain,
( X1 = empty_set
| X1 = singleton(X2)
| singleton(X2) != set_union2(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zhvqu7cv/lgb.p',i_0_15) ).
cnf(i_0_17,negated_conjecture,
esk4_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zhvqu7cv/lgb.p',i_0_17) ).
cnf(i_0_18,negated_conjecture,
esk5_0 != esk4_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zhvqu7cv/lgb.p',i_0_18) ).
cnf(c_0_26,plain,
( X1 = empty_set
| X1 = singleton(X2)
| singleton(X2) != set_union2(X3,X1) ),
i_0_8 ).
cnf(c_0_27,negated_conjecture,
set_union2(esk4_0,esk5_0) = singleton(esk3_0),
i_0_19 ).
cnf(c_0_28,negated_conjecture,
esk5_0 != empty_set,
i_0_16 ).
cnf(c_0_29,negated_conjecture,
( singleton(X1) = esk5_0
| singleton(X1) != singleton(esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
singleton(esk3_0) = esk5_0,
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_31,plain,
( X1 = empty_set
| X1 = singleton(X2)
| singleton(X2) != set_union2(X1,X3) ),
i_0_15 ).
cnf(c_0_32,negated_conjecture,
set_union2(esk4_0,esk5_0) = esk5_0,
inference(rw,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
esk4_0 != empty_set,
i_0_17 ).
cnf(c_0_34,plain,
( singleton(X1) = esk4_0
| singleton(X1) != esk5_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
esk5_0 != esk4_0,
i_0_18 ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET903+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jul 9 17:49:47 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.25/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.25/2.28 # No SInE strategy applied
% 7.25/2.28 # Trying AutoSched0 for 150 seconds
% 7.25/2.28 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 7.25/2.28 # and selection function SelectNewComplexAHP.
% 7.25/2.28 #
% 7.25/2.28 # Preprocessing time : 0.023 s
% 7.25/2.28
% 7.25/2.28 # Proof found!
% 7.25/2.28 # SZS status Theorem
% 7.25/2.28 # SZS output start CNFRefutation
% See solution above
% 7.25/2.28 # Training examples: 0 positive, 0 negative
% 7.25/2.28
% 7.25/2.28 # -------------------------------------------------
% 7.25/2.28 # User time : 0.024 s
% 7.25/2.28 # System time : 0.005 s
% 7.25/2.28 # Total time : 0.028 s
% 7.25/2.28 # Maximum resident set size: 7124 pages
% 7.25/2.28
%------------------------------------------------------------------------------