TSTP Solution File: SEU162+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU162+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:30:40 EDT 2023
% Result : Timeout 408.28s 300.17s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 4 unt; 0 def)
% Number of atoms : 52 ( 11 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 22 ~; 17 |; 3 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t65_zfmisc_1,conjecture,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.2MWVTJ4O9e/E---3.1_3024.p',t65_zfmisc_1) ).
fof(l28_zfmisc_1,axiom,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.2MWVTJ4O9e/E---3.1_3024.p',l28_zfmisc_1) ).
fof(t83_xboole_1,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.2MWVTJ4O9e/E---3.1_3024.p',t83_xboole_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.2MWVTJ4O9e/E---3.1_3024.p',symmetry_r1_xboole_0) ).
fof(l25_zfmisc_1,axiom,
! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.2MWVTJ4O9e/E---3.1_3024.p',l25_zfmisc_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t65_zfmisc_1])]) ).
fof(c_0_6,plain,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[l28_zfmisc_1]) ).
fof(c_0_7,negated_conjecture,
( ( set_difference(esk1_0,singleton(esk2_0)) != esk1_0
| in(esk2_0,esk1_0) )
& ( set_difference(esk1_0,singleton(esk2_0)) = esk1_0
| ~ in(esk2_0,esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X11,X12] :
( ( ~ disjoint(X11,X12)
| set_difference(X11,X12) = X11 )
& ( set_difference(X11,X12) != X11
| disjoint(X11,X12) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])]) ).
fof(c_0_9,plain,
! [X13,X14] :
( ~ disjoint(X13,X14)
| disjoint(X14,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_10,plain,
! [X9,X10] :
( in(X9,X10)
| disjoint(singleton(X9),X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
cnf(c_0_11,negated_conjecture,
( in(esk2_0,esk1_0)
| set_difference(esk1_0,singleton(esk2_0)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( disjoint(X2,X1)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,X2)
| disjoint(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( set_difference(esk1_0,singleton(esk2_0)) = esk1_0
| ~ in(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( in(esk2_0,esk1_0)
| ~ disjoint(esk1_0,singleton(esk2_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( disjoint(X1,singleton(X2))
| in(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( disjoint(esk1_0,singleton(esk2_0))
| ~ in(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
in(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
! [X7,X8] :
( ~ disjoint(singleton(X7),X8)
| ~ in(X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l25_zfmisc_1])]) ).
cnf(c_0_22,negated_conjecture,
disjoint(esk1_0,singleton(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_23,plain,
( ~ disjoint(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
disjoint(singleton(esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU162+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 08:20:10 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.2MWVTJ4O9e/E---3.1_3024.p
% 408.28/300.17 # Version: 3.1pre001
% 408.28/300.17 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/300.17 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/300.17 # Starting new_bool_3 with 300s (1) cores
% 408.28/300.17 # Starting new_bool_1 with 300s (1) cores
% 408.28/300.17 # Starting sh5l with 300s (1) cores
% 408.28/300.17 # new_bool_1 with pid 3103 completed with status 0
% 408.28/300.17 # Result found by new_bool_1
% 408.28/300.17 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/300.17 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/300.17 # Starting new_bool_3 with 300s (1) cores
% 408.28/300.17 # Starting new_bool_1 with 300s (1) cores
% 408.28/300.17 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.28/300.17 # Search class: FGHSF-FFSF21-SFFFFFNN
% 408.28/300.17 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.28/300.17 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.28/300.17 # SAT001_MinMin_p005000_rr_RG with pid 3105 completed with status 0
% 408.28/300.17 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.28/300.17 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/300.17 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/300.17 # Starting new_bool_3 with 300s (1) cores
% 408.28/300.17 # Starting new_bool_1 with 300s (1) cores
% 408.28/300.17 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.28/300.17 # Search class: FGHSF-FFSF21-SFFFFFNN
% 408.28/300.17 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.28/300.17 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.28/300.17 # Preprocessing time : 0.001 s
% 408.28/300.17 # Presaturation interreduction done
% 408.28/300.17
% 408.28/300.17 # Proof found!
% 408.28/300.17 # SZS status Theorem
% 408.28/300.17 # SZS output start CNFRefutation
% See solution above
% 408.28/300.17 # Parsed axioms : 8
% 408.28/300.17 # Removed by relevancy pruning/SinE : 2
% 408.28/300.17 # Initial clauses : 8
% 408.28/300.17 # Removed in clause preprocessing : 0
% 408.28/300.17 # Initial clauses in saturation : 8
% 408.28/300.17 # Processed clauses : 26
% 408.28/300.17 # ...of these trivial : 1
% 408.28/300.17 # ...subsumed : 0
% 408.28/300.17 # ...remaining for further processing : 25
% 408.28/300.17 # Other redundant clauses eliminated : 0
% 408.28/300.17 # Clauses deleted for lack of memory : 0
% 408.28/300.17 # Backward-subsumed : 0
% 408.28/300.17 # Backward-rewritten : 4
% 408.28/300.17 # Generated clauses : 16
% 408.28/300.17 # ...of the previous two non-redundant : 12
% 408.28/300.17 # ...aggressively subsumed : 0
% 408.28/300.17 # Contextual simplify-reflections : 0
% 408.28/300.17 # Paramodulations : 16
% 408.28/300.17 # Factorizations : 0
% 408.28/300.17 # NegExts : 0
% 408.28/300.17 # Equation resolutions : 0
% 408.28/300.17 # Total rewrite steps : 7
% 408.28/300.17 # Propositional unsat checks : 0
% 408.28/300.17 # Propositional check models : 0
% 408.28/300.17 # Propositional check unsatisfiable : 0
% 408.28/300.17 # Propositional clauses : 0
% 408.28/300.17 # Propositional clauses after purity: 0
% 408.28/300.17 # Propositional unsat core size : 0
% 408.28/300.17 # Propositional preprocessing time : 0.000
% 408.28/300.17 # Propositional encoding time : 0.000
% 408.28/300.17 # Propositional solver time : 0.000
% 408.28/300.17 # Success case prop preproc time : 0.000
% 408.28/300.17 # Success case prop encoding time : 0.000
% 408.28/300.17 # Success case prop solver time : 0.000
% 408.28/300.17 # Current number of processed clauses : 13
% 408.28/300.17 # Positive orientable unit clauses : 4
% 408.28/300.17 # Positive unorientable unit clauses: 0
% 408.28/300.17 # Negative unit clauses : 1
% 408.28/300.17 # Non-unit-clauses : 8
% 408.28/300.17 # Current number of unprocessed clauses: 2
% 408.28/300.17 # ...number of literals in the above : 4
% 408.28/300.17 # Current number of archived formulas : 0
% 408.28/300.17 # Current number of archived clauses : 12
% 408.28/300.17 # Clause-clause subsumption calls (NU) : 5
% 408.28/300.17 # Rec. Clause-clause subsumption calls : 5
% 408.28/300.17 # Non-unit clause-clause subsumptions : 0
% 408.28/300.17 # Unit Clause-clause subsumption calls : 0
% 408.28/300.17 # Rewrite failures with RHS unbound : 0
% 408.28/300.17 # BW rewrite match attempts : 1
% 408.28/300.17 # BW rewrite match successes : 1
% 408.28/300.17 # Condensation attempts : 0
% 408.28/300.17 # Condensation successes : 0
% 408.28/300.17 # Termbank termtop insertions : 615
% 408.28/300.17
% 408.28/300.17 # -------------------------------------------------
% 408.28/300.17 # User time : 0.004 s
% 408.28/300.17 # System time : 0.001 s
% 408.28/300.17 # Total time : 0.005 s
% 408.28/300.17 # Maximum resident set size: 1732 pages
% 408.28/300.17
% 408.28/300.17 # -------------------------------------------------
% 408.28/300.17 # User time : 0.004 s
% 408.28/300.17 # System time : 0.004 s
% 408.28/300.17 # Total time : 0.008 s
% 408.28/300.17 # Maximum resident set size: 1676 pages
% 408.28/300.17 % E---3.1 exiting
%------------------------------------------------------------------------------