TSTP Solution File: SEU120+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:25 EDT 2023
% Result : Timeout 0.30s 300.20s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 46 ( 12 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 55 ( 27 ~; 14 |; 11 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 3 sgn; 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_xboole_0,conjecture,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.tjzBRnv9Uh/E---3.1_13503.p',t4_xboole_0) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.tjzBRnv9Uh/E---3.1_13503.p',d1_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.tjzBRnv9Uh/E---3.1_13503.p',d7_xboole_0) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t4_xboole_0])]) ).
fof(c_0_4,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_5,negated_conjecture,
! [X6] :
( ( in(esk3_0,set_intersection2(esk1_0,esk2_0))
| ~ disjoint(esk1_0,esk2_0) )
& ( disjoint(esk1_0,esk2_0)
| ~ disjoint(esk1_0,esk2_0) )
& ( in(esk3_0,set_intersection2(esk1_0,esk2_0))
| ~ in(X6,set_intersection2(esk1_0,esk2_0)) )
& ( disjoint(esk1_0,esk2_0)
| ~ in(X6,set_intersection2(esk1_0,esk2_0)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X14,X15,X16] :
( ( X14 != empty_set
| ~ in(X15,X14) )
& ( in(esk4_1(X16),X16)
| X16 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_7,plain,
! [X8,X9] :
( ( ~ disjoint(X8,X9)
| set_intersection2(X8,X9) = empty_set )
& ( set_intersection2(X8,X9) != empty_set
| disjoint(X8,X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
cnf(c_0_8,negated_conjecture,
( disjoint(esk1_0,esk2_0)
| ~ in(X1,set_intersection2(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(esk4_1(X1),X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( in(esk3_0,set_intersection2(esk1_0,esk2_0))
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
set_intersection2(esk1_0,esk2_0) = empty_set,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ disjoint(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n004.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 08:58:30 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.tjzBRnv9Uh/E---3.1_13503.p
% 0.30/300.20 # Version: 3.1pre001
% 0.30/300.20 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/300.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.20 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/300.20 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.20 # Starting new_bool_1 with 300s (1) cores
% 0.30/300.20 # Starting sh5l with 300s (1) cores
% 0.30/300.20 # new_bool_3 with pid 13583 completed with status 0
% 0.30/300.20 # Result found by new_bool_3
% 0.30/300.20 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/300.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.20 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/300.20 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.20 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/300.20 # Search class: FGHSS-FFSF21-SFFFFFNN
% 0.30/300.20 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/300.20 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.30/300.20 # SAT001_MinMin_p005000_rr_RG with pid 13586 completed with status 0
% 0.30/300.20 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.30/300.20 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/300.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.20 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/300.20 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.20 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/300.20 # Search class: FGHSS-FFSF21-SFFFFFNN
% 0.30/300.20 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/300.20 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.30/300.20 # Preprocessing time : 0.001 s
% 0.30/300.20 # Presaturation interreduction done
% 0.30/300.20
% 0.30/300.20 # Proof found!
% 0.30/300.20 # SZS status Theorem
% 0.30/300.20 # SZS output start CNFRefutation
% See solution above
% 0.30/300.20 # Parsed axioms : 12
% 0.30/300.20 # Removed by relevancy pruning/SinE : 2
% 0.30/300.20 # Initial clauses : 15
% 0.30/300.20 # Removed in clause preprocessing : 1
% 0.30/300.20 # Initial clauses in saturation : 14
% 0.30/300.20 # Processed clauses : 35
% 0.30/300.20 # ...of these trivial : 0
% 0.30/300.20 # ...subsumed : 1
% 0.30/300.20 # ...remaining for further processing : 34
% 0.30/300.20 # Other redundant clauses eliminated : 1
% 0.30/300.20 # Clauses deleted for lack of memory : 0
% 0.30/300.20 # Backward-subsumed : 0
% 0.30/300.20 # Backward-rewritten : 4
% 0.30/300.20 # Generated clauses : 15
% 0.30/300.20 # ...of the previous two non-redundant : 13
% 0.30/300.20 # ...aggressively subsumed : 0
% 0.30/300.20 # Contextual simplify-reflections : 1
% 0.30/300.20 # Paramodulations : 14
% 0.30/300.20 # Factorizations : 0
% 0.30/300.20 # NegExts : 0
% 0.30/300.20 # Equation resolutions : 1
% 0.30/300.20 # Total rewrite steps : 8
% 0.30/300.20 # Propositional unsat checks : 0
% 0.30/300.20 # Propositional check models : 0
% 0.30/300.20 # Propositional check unsatisfiable : 0
% 0.30/300.20 # Propositional clauses : 0
% 0.30/300.20 # Propositional clauses after purity: 0
% 0.30/300.20 # Propositional unsat core size : 0
% 0.30/300.20 # Propositional preprocessing time : 0.000
% 0.30/300.20 # Propositional encoding time : 0.000
% 0.30/300.20 # Propositional solver time : 0.000
% 0.30/300.20 # Success case prop preproc time : 0.000
% 0.30/300.20 # Success case prop encoding time : 0.000
% 0.30/300.20 # Success case prop solver time : 0.000
% 0.30/300.20 # Current number of processed clauses : 15
% 0.30/300.20 # Positive orientable unit clauses : 4
% 0.30/300.20 # Positive unorientable unit clauses: 1
% 0.30/300.20 # Negative unit clauses : 3
% 0.30/300.20 # Non-unit-clauses : 7
% 0.30/300.20 # Current number of unprocessed clauses: 6
% 0.30/300.20 # ...number of literals in the above : 11
% 0.30/300.20 # Current number of archived formulas : 0
% 0.30/300.20 # Current number of archived clauses : 18
% 0.30/300.20 # Clause-clause subsumption calls (NU) : 11
% 0.30/300.20 # Rec. Clause-clause subsumption calls : 10
% 0.30/300.20 # Non-unit clause-clause subsumptions : 2
% 0.30/300.20 # Unit Clause-clause subsumption calls : 8
% 0.30/300.20 # Rewrite failures with RHS unbound : 0
% 0.30/300.20 # BW rewrite match attempts : 15
% 0.30/300.20 # BW rewrite match successes : 13
% 0.30/300.20 # Condensation attempts : 0
% 0.30/300.20 # Condensation successes : 0
% 0.30/300.20 # Termbank termtop insertions : 758
% 0.30/300.20
% 0.30/300.20 # -------------------------------------------------
% 0.30/300.20 # User time : 0.005 s
% 0.30/300.20 # System time : 0.001 s
% 0.30/300.20 # Total time : 0.006 s
% 0.30/300.20 # Maximum resident set size: 1764 pages
% 0.30/300.20
% 0.30/300.20 # -------------------------------------------------
% 0.30/300.20 # User time : 0.005 s
% 0.30/300.20 # System time : 0.004 s
% 0.30/300.20 # Total time : 0.009 s
% 0.30/300.20 # Maximum resident set size: 1672 pages
% 0.30/300.20 % E---3.1 exiting
%------------------------------------------------------------------------------