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