TSTP Solution File: SET159+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET159+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:10:01 EDT 2022
% Result : Theorem 9.85s 2.49s
% Output : CNFRefutation 9.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 10 unt; 7 nHn; 19 RR)
% Number of literals : 50 ( 9 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,negated_conjecture,
union(union(esk3_0,esk4_0),esk5_0) != union(esk3_0,union(esk4_0,esk5_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j1pi6xx0/lgb.p',i_0_16) ).
cnf(i_0_7,plain,
union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j1pi6xx0/lgb.p',i_0_7) ).
cnf(i_0_13,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j1pi6xx0/lgb.p',i_0_13) ).
cnf(i_0_2,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j1pi6xx0/lgb.p',i_0_2) ).
cnf(i_0_12,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j1pi6xx0/lgb.p',i_0_12) ).
cnf(i_0_1,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j1pi6xx0/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j1pi6xx0/lgb.p',i_0_3) ).
cnf(c_0_24,negated_conjecture,
union(union(esk3_0,esk4_0),esk5_0) != union(esk3_0,union(esk4_0,esk5_0)),
i_0_16 ).
cnf(c_0_25,plain,
union(X1,X2) = union(X2,X1),
i_0_7 ).
cnf(c_0_26,negated_conjecture,
union(esk5_0,union(esk3_0,esk4_0)) != union(esk3_0,union(esk4_0,esk5_0)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
i_0_13 ).
cnf(c_0_28,negated_conjecture,
( ~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk5_0,union(esk3_0,esk4_0)))
| ~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,union(esk4_0,esk5_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_29,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_30,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_31,plain,
( ~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,union(esk4_0,esk5_0)))
| ~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),esk5_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
i_0_1 ).
cnf(c_0_33,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_3 ).
cnf(c_0_34,negated_conjecture,
( member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,union(esk4_0,esk5_0)))
| member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk5_0,union(esk3_0,esk4_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_30])]) ).
cnf(c_0_35,plain,
~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),esk5_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_32]) ).
cnf(c_0_36,plain,
( ~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,union(esk4_0,esk5_0)))
| ~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_32]) ).
cnf(c_0_37,plain,
( member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,union(esk4_0,esk5_0)))
| member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,esk4_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_29]) ).
cnf(c_0_39,plain,
( ~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,esk4_0))
| ~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_40,plain,
( member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,esk4_0))
| member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk4_0,esk5_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
~ member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_32]) ).
cnf(c_0_42,plain,
member(esk2_2(union(esk3_0,union(esk4_0,esk5_0)),union(esk5_0,union(esk3_0,esk4_0))),union(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_40]),c_0_41]),c_0_35]) ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_42]),c_0_38]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET159+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n011.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 : Mon Jul 11 02:07:58 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 9.85/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.85/2.49 # No SInE strategy applied
% 9.85/2.49 # Trying AutoSched0 for 150 seconds
% 9.85/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 9.85/2.49 # and selection function MSelectComplexExceptUniqMaxHorn.
% 9.85/2.49 #
% 9.85/2.49 # Preprocessing time : 0.023 s
% 9.85/2.49 # Presaturation interreduction done
% 9.85/2.49
% 9.85/2.49 # Proof found!
% 9.85/2.49 # SZS status Theorem
% 9.85/2.49 # SZS output start CNFRefutation
% See solution above
% 9.85/2.49 # Training examples: 0 positive, 0 negative
% 9.85/2.49
% 9.85/2.49 # -------------------------------------------------
% 9.85/2.49 # User time : 0.314 s
% 9.85/2.49 # System time : 0.020 s
% 9.85/2.49 # Total time : 0.335 s
% 9.85/2.49 # Maximum resident set size: 7128 pages
% 9.85/2.49
%------------------------------------------------------------------------------