TSTP Solution File: SET063+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET063+4 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 300s
% DateTime : Tue May 21 02:57:18 EDT 2024
% Result : Theorem 0.16s 0.41s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 51 ( 22 ~; 17 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 5 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(thI17,conjecture,
! [X1] : equal_set(intersection(X1,empty_set),empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI17) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(c_0_5,plain,
! [X3] : ~ member(X3,empty_set),
inference(fof_simplification,[status(thm)],[empty_set]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] : equal_set(intersection(X1,empty_set),empty_set),
inference(assume_negation,[status(cth)],[thI17]) ).
fof(c_0_7,plain,
! [X9] : ~ member(X9,empty_set),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).
fof(c_0_8,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ subset(X13,X14)
| ~ member(X15,X13)
| member(X15,X14) )
& ( member(esk2_2(X16,X17),X16)
| subset(X16,X17) )
& ( ~ member(esk2_2(X16,X17),X17)
| subset(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])])]) ).
fof(c_0_9,plain,
! [X10,X11,X12] :
( ( member(X10,X11)
| ~ member(X10,intersection(X11,X12)) )
& ( member(X10,X12)
| ~ member(X10,intersection(X11,X12)) )
& ( ~ member(X10,X11)
| ~ member(X10,X12)
| member(X10,intersection(X11,X12)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
fof(c_0_10,negated_conjecture,
~ equal_set(intersection(esk1_0,empty_set),empty_set),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11,plain,
! [X7,X8] :
( ( subset(X7,X8)
| ~ equal_set(X7,X8) )
& ( subset(X8,X7)
| ~ equal_set(X7,X8) )
& ( ~ subset(X7,X8)
| ~ subset(X8,X7)
| equal_set(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])]) ).
cnf(c_0_12,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( member(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ equal_set(intersection(esk1_0,empty_set),empty_set),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( member(esk2_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ subset(intersection(esk1_0,empty_set),empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
subset(intersection(X1,empty_set),X2),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET063+4 : TPTP v8.2.0. Released v2.2.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 12:09:52 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.40 Running first-order model finding
% 0.16/0.40 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/benchmark/theBenchmark.p
% 0.16/0.41 # Version: 3.1.0
% 0.16/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.41 # Starting sh5l with 300s (1) cores
% 0.16/0.41 # new_bool_3 with pid 23366 completed with status 0
% 0.16/0.41 # Result found by new_bool_3
% 0.16/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.41 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.16/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.41 # SAT001_MinMin_p005000_rr_RG with pid 23369 completed with status 0
% 0.16/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.41 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.16/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.41 # Preprocessing time : 0.001 s
% 0.16/0.41 # Presaturation interreduction done
% 0.16/0.41
% 0.16/0.41 # Proof found!
% 0.16/0.41 # SZS status Theorem
% 0.16/0.41 # SZS output start CNFRefutation
% See solution above
% 0.16/0.41 # Parsed axioms : 12
% 0.16/0.41 # Removed by relevancy pruning/SinE : 7
% 0.16/0.41 # Initial clauses : 11
% 0.16/0.41 # Removed in clause preprocessing : 0
% 0.16/0.41 # Initial clauses in saturation : 11
% 0.16/0.41 # Processed clauses : 29
% 0.16/0.41 # ...of these trivial : 0
% 0.16/0.41 # ...subsumed : 1
% 0.16/0.41 # ...remaining for further processing : 28
% 0.16/0.41 # Other redundant clauses eliminated : 0
% 0.16/0.41 # Clauses deleted for lack of memory : 0
% 0.16/0.41 # Backward-subsumed : 0
% 0.16/0.41 # Backward-rewritten : 1
% 0.16/0.41 # Generated clauses : 21
% 0.16/0.41 # ...of the previous two non-redundant : 15
% 0.16/0.41 # ...aggressively subsumed : 0
% 0.16/0.41 # Contextual simplify-reflections : 0
% 0.16/0.41 # Paramodulations : 21
% 0.16/0.41 # Factorizations : 0
% 0.16/0.41 # NegExts : 0
% 0.16/0.41 # Equation resolutions : 0
% 0.16/0.41 # Disequality decompositions : 0
% 0.16/0.41 # Total rewrite steps : 2
% 0.16/0.41 # ...of those cached : 0
% 0.16/0.41 # Propositional unsat checks : 0
% 0.16/0.41 # Propositional check models : 0
% 0.16/0.41 # Propositional check unsatisfiable : 0
% 0.16/0.41 # Propositional clauses : 0
% 0.16/0.41 # Propositional clauses after purity: 0
% 0.16/0.41 # Propositional unsat core size : 0
% 0.16/0.41 # Propositional preprocessing time : 0.000
% 0.16/0.41 # Propositional encoding time : 0.000
% 0.16/0.41 # Propositional solver time : 0.000
% 0.16/0.41 # Success case prop preproc time : 0.000
% 0.16/0.41 # Success case prop encoding time : 0.000
% 0.16/0.41 # Success case prop solver time : 0.000
% 0.16/0.41 # Current number of processed clauses : 16
% 0.16/0.41 # Positive orientable unit clauses : 3
% 0.16/0.41 # Positive unorientable unit clauses: 0
% 0.16/0.41 # Negative unit clauses : 2
% 0.16/0.41 # Non-unit-clauses : 11
% 0.16/0.41 # Current number of unprocessed clauses: 8
% 0.16/0.41 # ...number of literals in the above : 14
% 0.16/0.41 # Current number of archived formulas : 0
% 0.16/0.41 # Current number of archived clauses : 12
% 0.16/0.41 # Clause-clause subsumption calls (NU) : 16
% 0.16/0.41 # Rec. Clause-clause subsumption calls : 16
% 0.16/0.41 # Non-unit clause-clause subsumptions : 0
% 0.16/0.41 # Unit Clause-clause subsumption calls : 9
% 0.16/0.41 # Rewrite failures with RHS unbound : 0
% 0.16/0.41 # BW rewrite match attempts : 5
% 0.16/0.41 # BW rewrite match successes : 1
% 0.16/0.41 # Condensation attempts : 0
% 0.16/0.41 # Condensation successes : 0
% 0.16/0.41 # Termbank termtop insertions : 966
% 0.16/0.41 # Search garbage collected termcells : 222
% 0.16/0.41
% 0.16/0.41 # -------------------------------------------------
% 0.16/0.41 # User time : 0.003 s
% 0.16/0.41 # System time : 0.002 s
% 0.16/0.41 # Total time : 0.004 s
% 0.16/0.41 # Maximum resident set size: 1748 pages
% 0.16/0.41
% 0.16/0.41 # -------------------------------------------------
% 0.16/0.41 # User time : 0.004 s
% 0.16/0.41 # System time : 0.003 s
% 0.16/0.41 # Total time : 0.007 s
% 0.16/0.41 # Maximum resident set size: 1708 pages
% 0.16/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------