TSTP Solution File: NUM386+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM386+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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 : Mon Jul 18 08:35:36 EDT 2022
% Result : Theorem 7.40s 2.25s
% Output : CNFRefutation 7.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 5 unt; 6 nHn; 23 RR)
% Number of literals : 62 ( 21 equ; 34 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_btn93f/input.p',i_0_17) ).
cnf(i_0_55,negated_conjecture,
( ~ in(esk14_0,esk15_0)
| ~ in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_btn93f/input.p',i_0_55) ).
cnf(i_0_16,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_btn93f/input.p',i_0_16) ).
cnf(i_0_12,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_btn93f/input.p',i_0_12) ).
cnf(i_0_18,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_btn93f/input.p',i_0_18) ).
cnf(i_0_53,negated_conjecture,
( esk14_0 = esk15_0
| in(esk14_0,esk15_0)
| in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_btn93f/input.p',i_0_53) ).
cnf(i_0_54,negated_conjecture,
( esk14_0 != esk15_0
| ~ in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_btn93f/input.p',i_0_54) ).
cnf(i_0_11,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_btn93f/input.p',i_0_11) ).
cnf(c_0_64,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
i_0_17 ).
cnf(c_0_65,negated_conjecture,
( ~ in(esk14_0,esk15_0)
| ~ in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
i_0_55 ).
cnf(c_0_66,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_67,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
i_0_16 ).
cnf(c_0_68,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_69,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
i_0_18 ).
cnf(c_0_70,negated_conjecture,
( esk14_0 = esk15_0
| in(esk14_0,esk15_0)
| in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
i_0_53 ).
cnf(c_0_71,negated_conjecture,
~ in(esk14_0,esk15_0),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_72,negated_conjecture,
( esk14_0 != esk15_0
| ~ in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
i_0_54 ).
cnf(c_0_73,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_74,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_75,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_69]) ).
cnf(c_0_76,negated_conjecture,
( esk14_0 = esk15_0
| in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
inference(sr,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
~ in(esk14_0,singleton(esk15_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_78,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_11 ).
cnf(c_0_79,plain,
esk14_0 = esk15_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_71]) ).
cnf(c_0_80,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_78])]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_79]),c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM386+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n003.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 : Thu Jul 7 06:38:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.40/2.25 # ENIGMATIC: Solved by autoschedule:
% 7.40/2.25 # No SInE strategy applied
% 7.40/2.25 # Trying AutoSched0 for 150 seconds
% 7.40/2.25 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 7.40/2.25 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.40/2.25 #
% 7.40/2.25 # Preprocessing time : 0.023 s
% 7.40/2.25 # Presaturation interreduction done
% 7.40/2.25
% 7.40/2.25 # Proof found!
% 7.40/2.25 # SZS status Theorem
% 7.40/2.25 # SZS output start CNFRefutation
% See solution above
% 7.40/2.25 # Training examples: 0 positive, 0 negative
% 7.40/2.25
% 7.40/2.25 # -------------------------------------------------
% 7.40/2.25 # User time : 0.029 s
% 7.40/2.25 # System time : 0.006 s
% 7.40/2.25 # Total time : 0.035 s
% 7.40/2.25 # Maximum resident set size: 7120 pages
% 7.40/2.25
%------------------------------------------------------------------------------