TSTP Solution File: SET062+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET062+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:21:52 EDT 2023
% Result : Theorem 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 10 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 5 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 2 sgn; 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/tmp.rDi0Q2JGwT/E---3.1_29837.p',empty_set_defn) ).
fof(prove_empty_set_subset,conjecture,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/tmp/tmp.rDi0Q2JGwT/E---3.1_29837.p',prove_empty_set_subset) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.rDi0Q2JGwT/E---3.1_29837.p',subset_defn) ).
fof(c_0_3,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] : subset(empty_set,X1),
inference(assume_negation,[status(cth)],[prove_empty_set_subset]) ).
fof(c_0_5,plain,
! [X12] : ~ member(X12,empty_set),
inference(variable_rename,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8,X9] :
( ( ~ subset(X5,X6)
| ~ member(X7,X5)
| member(X7,X6) )
& ( member(esk2_2(X8,X9),X8)
| subset(X8,X9) )
& ( ~ member(esk2_2(X8,X9),X9)
| subset(X8,X9) ) ),
inference(distribute,[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_defn])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ subset(empty_set,esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( member(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ subset(empty_set,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET062+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.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 : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:06:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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.rDi0Q2JGwT/E---3.1_29837.p
% 0.16/0.42 # Version: 3.1pre001
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # new_bool_3 with pid 29915 completed with status 0
% 0.16/0.42 # Result found by new_bool_3
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.42 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.42 # SAT001_MinMin_p005000_rr_RG with pid 29919 completed with status 0
% 0.16/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.42 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Theorem
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 5
% 0.16/0.42 # Removed by relevancy pruning/SinE : 1
% 0.16/0.42 # Initial clauses : 6
% 0.16/0.42 # Removed in clause preprocessing : 0
% 0.16/0.42 # Initial clauses in saturation : 6
% 0.16/0.42 # Processed clauses : 13
% 0.16/0.42 # ...of these trivial : 0
% 0.16/0.42 # ...subsumed : 0
% 0.16/0.42 # ...remaining for further processing : 13
% 0.16/0.42 # Other redundant clauses eliminated : 0
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 1
% 0.16/0.42 # Generated clauses : 4
% 0.16/0.42 # ...of the previous two non-redundant : 1
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 4
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 0
% 0.16/0.42 # Total rewrite steps : 2
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 6
% 0.16/0.42 # Positive orientable unit clauses : 2
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 1
% 0.16/0.42 # Non-unit-clauses : 3
% 0.16/0.42 # Current number of unprocessed clauses: 0
% 0.16/0.42 # ...number of literals in the above : 0
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 7
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 2
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 2
% 0.16/0.42 # Non-unit clause-clause subsumptions : 0
% 0.16/0.42 # Unit Clause-clause subsumption calls : 0
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 2
% 0.16/0.42 # BW rewrite match successes : 1
% 0.16/0.42 # Condensation attempts : 0
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 332
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.004 s
% 0.16/0.42 # System time : 0.000 s
% 0.16/0.42 # Total time : 0.004 s
% 0.16/0.42 # Maximum resident set size: 1740 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.004 s
% 0.16/0.42 # System time : 0.002 s
% 0.16/0.42 # Total time : 0.006 s
% 0.16/0.42 # Maximum resident set size: 1676 pages
% 0.16/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------