TSTP Solution File: SET581+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET581+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:23:00 EDT 2023
% Result : Timeout 408.24s 300.19s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 41 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 40 ( 18 ~; 10 |; 8 &)
% ( 2 <=>; 2 =>; 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 1 sgn; 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th24,conjecture,
! [X1,X2,X3] :
( ( member(X1,X2)
& member(X1,X3) )
=> not_equal(intersection(X2,X3),empty_set) ),
file('/export/starexec/sandbox/tmp/tmp.gIjo2Jh24H/E---3.1_25540.p',prove_th24) ).
fof(not_equal_defn,axiom,
! [X1,X2] :
( not_equal(X1,X2)
<=> X1 != X2 ),
file('/export/starexec/sandbox/tmp/tmp.gIjo2Jh24H/E---3.1_25540.p',not_equal_defn) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/tmp.gIjo2Jh24H/E---3.1_25540.p',empty_set_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.gIjo2Jh24H/E---3.1_25540.p',intersection_defn) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( member(X1,X2)
& member(X1,X3) )
=> not_equal(intersection(X2,X3),empty_set) ),
inference(assume_negation,[status(cth)],[prove_th24]) ).
fof(c_0_5,negated_conjecture,
( member(esk1_0,esk2_0)
& member(esk1_0,esk3_0)
& ~ not_equal(intersection(esk2_0,esk3_0),empty_set) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X7,X8] :
( ( ~ not_equal(X7,X8)
| X7 != X8 )
& ( X7 = X8
| not_equal(X7,X8) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[not_equal_defn])]) ).
fof(c_0_7,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
fof(c_0_8,plain,
! [X10,X11,X12] :
( ( member(X12,X10)
| ~ member(X12,intersection(X10,X11)) )
& ( member(X12,X11)
| ~ member(X12,intersection(X10,X11)) )
& ( ~ member(X12,X10)
| ~ member(X12,X11)
| member(X12,intersection(X10,X11)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])]) ).
cnf(c_0_9,negated_conjecture,
~ not_equal(intersection(esk2_0,esk3_0),empty_set),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( X1 = X2
| not_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X9] : ~ member(X9,empty_set),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
intersection(esk2_0,esk3_0) = empty_set,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
member(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
member(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET581+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 16:40:14 EDT 2023
% 0.22/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.gIjo2Jh24H/E---3.1_25540.p
% 408.24/300.19 # Version: 3.1pre001
% 408.24/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.24/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.24/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.24/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.24/300.19 # Starting new_bool_1 with 300s (1) cores
% 408.24/300.19 # Starting sh5l with 300s (1) cores
% 408.24/300.19 # new_bool_3 with pid 25704 completed with status 0
% 408.24/300.19 # Result found by new_bool_3
% 408.24/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.24/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.24/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.24/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.24/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.24/300.19 # Search class: FGHSF-FFSF22-SFFFFFNN
% 408.24/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.24/300.19 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.24/300.19 # SAT001_MinMin_p005000_rr_RG with pid 25709 completed with status 0
% 408.24/300.19 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.24/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.24/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.24/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.24/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.24/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.24/300.19 # Search class: FGHSF-FFSF22-SFFFFFNN
% 408.24/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.24/300.19 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.24/300.19 # Preprocessing time : 0.001 s
% 408.24/300.19 # Presaturation interreduction done
% 408.24/300.19
% 408.24/300.19 # Proof found!
% 408.24/300.19 # SZS status Theorem
% 408.24/300.19 # SZS output start CNFRefutation
% See solution above
% 408.24/300.19 # Parsed axioms : 7
% 408.24/300.19 # Removed by relevancy pruning/SinE : 1
% 408.24/300.19 # Initial clauses : 14
% 408.24/300.19 # Removed in clause preprocessing : 2
% 408.24/300.19 # Initial clauses in saturation : 12
% 408.24/300.19 # Processed clauses : 31
% 408.24/300.19 # ...of these trivial : 0
% 408.24/300.19 # ...subsumed : 5
% 408.24/300.19 # ...remaining for further processing : 26
% 408.24/300.19 # Other redundant clauses eliminated : 1
% 408.24/300.19 # Clauses deleted for lack of memory : 0
% 408.24/300.19 # Backward-subsumed : 0
% 408.24/300.19 # Backward-rewritten : 1
% 408.24/300.19 # Generated clauses : 15
% 408.24/300.19 # ...of the previous two non-redundant : 13
% 408.24/300.19 # ...aggressively subsumed : 0
% 408.24/300.19 # Contextual simplify-reflections : 0
% 408.24/300.19 # Paramodulations : 14
% 408.24/300.19 # Factorizations : 0
% 408.24/300.19 # NegExts : 0
% 408.24/300.19 # Equation resolutions : 1
% 408.24/300.19 # Total rewrite steps : 2
% 408.24/300.19 # Propositional unsat checks : 0
% 408.24/300.19 # Propositional check models : 0
% 408.24/300.19 # Propositional check unsatisfiable : 0
% 408.24/300.19 # Propositional clauses : 0
% 408.24/300.19 # Propositional clauses after purity: 0
% 408.24/300.19 # Propositional unsat core size : 0
% 408.24/300.19 # Propositional preprocessing time : 0.000
% 408.24/300.19 # Propositional encoding time : 0.000
% 408.24/300.19 # Propositional solver time : 0.000
% 408.24/300.19 # Success case prop preproc time : 0.000
% 408.24/300.19 # Success case prop encoding time : 0.000
% 408.24/300.19 # Success case prop solver time : 0.000
% 408.24/300.19 # Current number of processed clauses : 12
% 408.24/300.19 # Positive orientable unit clauses : 3
% 408.24/300.19 # Positive unorientable unit clauses: 1
% 408.24/300.19 # Negative unit clauses : 2
% 408.24/300.19 # Non-unit-clauses : 6
% 408.24/300.19 # Current number of unprocessed clauses: 6
% 408.24/300.19 # ...number of literals in the above : 17
% 408.24/300.19 # Current number of archived formulas : 0
% 408.24/300.19 # Current number of archived clauses : 13
% 408.24/300.19 # Clause-clause subsumption calls (NU) : 6
% 408.24/300.19 # Rec. Clause-clause subsumption calls : 6
% 408.24/300.19 # Non-unit clause-clause subsumptions : 2
% 408.24/300.19 # Unit Clause-clause subsumption calls : 2
% 408.24/300.19 # Rewrite failures with RHS unbound : 0
% 408.24/300.19 # BW rewrite match attempts : 9
% 408.24/300.19 # BW rewrite match successes : 9
% 408.24/300.19 # Condensation attempts : 0
% 408.24/300.19 # Condensation successes : 0
% 408.24/300.19 # Termbank termtop insertions : 805
% 408.24/300.19
% 408.24/300.19 # -------------------------------------------------
% 408.24/300.19 # User time : 0.005 s
% 408.24/300.19 # System time : 0.001 s
% 408.24/300.19 # Total time : 0.007 s
% 408.24/300.19 # Maximum resident set size: 1740 pages
% 408.24/300.19
% 408.24/300.19 # -------------------------------------------------
% 408.24/300.19 # User time : 0.007 s
% 408.24/300.19 # System time : 0.003 s
% 408.24/300.19 # Total time : 0.010 s
% 408.24/300.19 # Maximum resident set size: 1672 pages
% 408.24/300.19 % E---3.1 exiting
%------------------------------------------------------------------------------