TSTP Solution File: SEU126+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU126+1 : TPTP v8.1.0. Released v3.3.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 08:38:38 EDT 2022
% Result : Theorem 7.76s 2.39s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 9 unt; 2 nHn; 12 RR)
% Number of literals : 31 ( 9 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_24,negated_conjecture,
set_union2(esk5_0,esk6_0) != esk6_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_royh8ty/input.p',i_0_24) ).
cnf(i_0_2,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_royh8ty/input.p',i_0_2) ).
cnf(i_0_14,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_royh8ty/input.p',i_0_14) ).
cnf(i_0_25,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_royh8ty/input.p',i_0_25) ).
cnf(i_0_6,plain,
( X1 = set_union2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X3)
| in(esk1_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_royh8ty/input.p',i_0_6) ).
cnf(i_0_8,plain,
( X1 = set_union2(X2,X3)
| ~ in(esk1_3(X2,X3,X1),X1)
| ~ in(esk1_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_royh8ty/input.p',i_0_8) ).
cnf(c_0_32,negated_conjecture,
set_union2(esk5_0,esk6_0) != esk6_0,
i_0_24 ).
cnf(c_0_33,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_2 ).
cnf(c_0_34,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_14 ).
cnf(c_0_35,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_25 ).
cnf(c_0_36,negated_conjecture,
set_union2(esk6_0,esk5_0) != esk6_0,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( X1 = set_union2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X3)
| in(esk1_3(X2,X3,X1),X2) ),
i_0_6 ).
cnf(c_0_38,negated_conjecture,
( in(X1,esk6_0)
| ~ in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( X1 = set_union2(X2,X3)
| ~ in(esk1_3(X2,X3,X1),X1)
| ~ in(esk1_3(X2,X3,X1),X2) ),
i_0_8 ).
cnf(c_0_40,negated_conjecture,
in(esk1_3(esk6_0,esk5_0,esk6_0),esk6_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37])]),c_0_38]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_40])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU126+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n029.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jun 19 23:07:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 7.76/2.39 # ENIGMATIC: Solved by autoschedule:
% 7.76/2.39 # No SInE strategy applied
% 7.76/2.39 # Trying AutoSched0 for 150 seconds
% 7.76/2.39 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.76/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.76/2.39 #
% 7.76/2.39 # Preprocessing time : 0.013 s
% 7.76/2.39 # Presaturation interreduction done
% 7.76/2.39
% 7.76/2.39 # Proof found!
% 7.76/2.39 # SZS status Theorem
% 7.76/2.39 # SZS output start CNFRefutation
% See solution above
% 7.76/2.39 # Training examples: 0 positive, 0 negative
% 7.76/2.39
% 7.76/2.39 # -------------------------------------------------
% 7.76/2.39 # User time : 0.017 s
% 7.76/2.39 # System time : 0.004 s
% 7.76/2.39 # Total time : 0.021 s
% 7.76/2.39 # Maximum resident set size: 7120 pages
% 7.76/2.39
%------------------------------------------------------------------------------