TSTP Solution File: SET621+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET621+3 : TPTP v8.1.0. Released v2.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 00:12:54 EDT 2022
% Result : Theorem 7.27s 2.40s
% Output : CNFRefutation 7.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 4 RR)
% Number of literals : 8 ( 7 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,negated_conjecture,
union(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk4_0,union(esk3_0,esk5_0))) != difference(union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kwa50nth/input.p',i_0_23) ).
cnf(i_0_2,plain,
difference(difference(X1,X2),X3) = difference(X1,union(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kwa50nth/input.p',i_0_2) ).
cnf(i_0_3,plain,
union(difference(X1,X2),difference(X3,X2)) = difference(union(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kwa50nth/input.p',i_0_3) ).
cnf(c_0_27,negated_conjecture,
union(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk4_0,union(esk3_0,esk5_0))) != difference(union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),esk5_0),
i_0_23 ).
cnf(c_0_28,plain,
difference(difference(X1,X2),X3) = difference(X1,union(X2,X3)),
i_0_2 ).
cnf(c_0_29,negated_conjecture,
union(difference(difference(esk3_0,esk4_0),esk5_0),difference(difference(esk4_0,esk3_0),esk5_0)) != difference(union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),esk5_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_30,plain,
union(difference(X1,X2),difference(X3,X2)) = difference(union(X1,X3),X2),
i_0_3 ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET621+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 18:53:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.27/2.40 # ENIGMATIC: Solved by autoschedule:
% 7.27/2.40 # No SInE strategy applied
% 7.27/2.40 # Trying AutoSched0 for 150 seconds
% 7.27/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S032N
% 7.27/2.40 # and selection function SelectUnlessUniqMax.
% 7.27/2.40 #
% 7.27/2.40 # Preprocessing time : 0.019 s
% 7.27/2.40 # Presaturation interreduction done
% 7.27/2.40
% 7.27/2.40 # Proof found!
% 7.27/2.40 # SZS status Theorem
% 7.27/2.40 # SZS output start CNFRefutation
% See solution above
% 7.27/2.40 # Training examples: 0 positive, 0 negative
% 7.27/2.40
% 7.27/2.40 # -------------------------------------------------
% 7.27/2.40 # User time : 0.021 s
% 7.27/2.40 # System time : 0.002 s
% 7.27/2.40 # Total time : 0.023 s
% 7.27/2.40 # Maximum resident set size: 7120 pages
% 7.27/2.40
%------------------------------------------------------------------------------