TSTP Solution File: SEU158+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU158+3 : TPTP v8.1.2. Released v3.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:25:00 EDT 2023
% Result : Timeout 408.12s 300.19s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 23 ( 10 ~; 8 |; 2 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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-1 aty)
% Number of variables : 12 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t37_zfmisc_1,conjecture,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.nVfcJ2gPOr/E---3.1_19295.p',t37_zfmisc_1) ).
fof(l2_zfmisc_1,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.nVfcJ2gPOr/E---3.1_19295.p',l2_zfmisc_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
inference(assume_negation,[status(cth)],[t37_zfmisc_1]) ).
fof(c_0_3,negated_conjecture,
( ( ~ subset(singleton(esk1_0),esk2_0)
| ~ in(esk1_0,esk2_0) )
& ( subset(singleton(esk1_0),esk2_0)
| in(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X7,X8] :
( ( ~ subset(singleton(X7),X8)
| in(X7,X8) )
& ( ~ in(X7,X8)
| subset(singleton(X7),X8) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])]) ).
cnf(c_0_5,negated_conjecture,
( ~ subset(singleton(esk1_0),esk2_0)
| ~ in(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( subset(singleton(esk1_0),esk2_0)
| in(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
~ in(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
subset(singleton(esk1_0),esk2_0),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEU158+3 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n002.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 08:39:44 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.nVfcJ2gPOr/E---3.1_19295.p
% 408.12/300.19 # Version: 3.1pre001
% 408.12/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.12/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.12/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.12/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.12/300.19 # Starting new_bool_1 with 300s (1) cores
% 408.12/300.19 # Starting sh5l with 300s (1) cores
% 408.12/300.19 # new_bool_3 with pid 19407 completed with status 0
% 408.12/300.19 # Result found by new_bool_3
% 408.12/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.12/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.12/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.12/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.12/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.12/300.19 # Search class: FGHNF-FFSF11-SFFFFFNN
% 408.12/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.12/300.19 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.12/300.19 # SAT001_MinMin_p005000_rr_RG with pid 19413 completed with status 0
% 408.12/300.19 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.12/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.12/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.12/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.12/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.12/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.12/300.19 # Search class: FGHNF-FFSF11-SFFFFFNN
% 408.12/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.12/300.19 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.12/300.19 # Preprocessing time : 0.001 s
% 408.12/300.19 # Presaturation interreduction done
% 408.12/300.19
% 408.12/300.19 # Proof found!
% 408.12/300.19 # SZS status Theorem
% 408.12/300.19 # SZS output start CNFRefutation
% See solution above
% 408.12/300.19 # Parsed axioms : 6
% 408.12/300.19 # Removed by relevancy pruning/SinE : 2
% 408.12/300.19 # Initial clauses : 6
% 408.12/300.19 # Removed in clause preprocessing : 0
% 408.12/300.19 # Initial clauses in saturation : 6
% 408.12/300.19 # Processed clauses : 13
% 408.12/300.19 # ...of these trivial : 0
% 408.12/300.19 # ...subsumed : 0
% 408.12/300.19 # ...remaining for further processing : 13
% 408.12/300.19 # Other redundant clauses eliminated : 0
% 408.12/300.19 # Clauses deleted for lack of memory : 0
% 408.12/300.19 # Backward-subsumed : 1
% 408.12/300.19 # Backward-rewritten : 0
% 408.12/300.19 # Generated clauses : 4
% 408.12/300.19 # ...of the previous two non-redundant : 2
% 408.12/300.19 # ...aggressively subsumed : 0
% 408.12/300.19 # Contextual simplify-reflections : 0
% 408.12/300.19 # Paramodulations : 4
% 408.12/300.19 # Factorizations : 0
% 408.12/300.19 # NegExts : 0
% 408.12/300.19 # Equation resolutions : 0
% 408.12/300.19 # Total rewrite steps : 0
% 408.12/300.19 # Propositional unsat checks : 0
% 408.12/300.19 # Propositional check models : 0
% 408.12/300.19 # Propositional check unsatisfiable : 0
% 408.12/300.19 # Propositional clauses : 0
% 408.12/300.19 # Propositional clauses after purity: 0
% 408.12/300.19 # Propositional unsat core size : 0
% 408.12/300.19 # Propositional preprocessing time : 0.000
% 408.12/300.19 # Propositional encoding time : 0.000
% 408.12/300.19 # Propositional solver time : 0.000
% 408.12/300.19 # Success case prop preproc time : 0.000
% 408.12/300.19 # Success case prop encoding time : 0.000
% 408.12/300.19 # Success case prop solver time : 0.000
% 408.12/300.19 # Current number of processed clauses : 6
% 408.12/300.19 # Positive orientable unit clauses : 2
% 408.12/300.19 # Positive unorientable unit clauses: 0
% 408.12/300.19 # Negative unit clauses : 1
% 408.12/300.19 # Non-unit-clauses : 3
% 408.12/300.19 # Current number of unprocessed clauses: 1
% 408.12/300.19 # ...number of literals in the above : 1
% 408.12/300.19 # Current number of archived formulas : 0
% 408.12/300.19 # Current number of archived clauses : 7
% 408.12/300.19 # Clause-clause subsumption calls (NU) : 0
% 408.12/300.19 # Rec. Clause-clause subsumption calls : 0
% 408.12/300.19 # Non-unit clause-clause subsumptions : 0
% 408.12/300.19 # Unit Clause-clause subsumption calls : 1
% 408.12/300.19 # Rewrite failures with RHS unbound : 0
% 408.12/300.19 # BW rewrite match attempts : 0
% 408.12/300.19 # BW rewrite match successes : 0
% 408.12/300.19 # Condensation attempts : 0
% 408.12/300.19 # Condensation successes : 0
% 408.12/300.19 # Termbank termtop insertions : 359
% 408.12/300.19
% 408.12/300.19 # -------------------------------------------------
% 408.12/300.19 # User time : 0.002 s
% 408.12/300.19 # System time : 0.002 s
% 408.12/300.19 # Total time : 0.004 s
% 408.12/300.19 # Maximum resident set size: 1744 pages
% 408.12/300.19
% 408.12/300.19 # -------------------------------------------------
% 408.12/300.19 # User time : 0.003 s
% 408.12/300.19 # System time : 0.004 s
% 408.12/300.19 # Total time : 0.007 s
% 408.12/300.19 # Maximum resident set size: 1672 pages
% 408.12/300.19 % E---3.1 exiting
% 408.12/300.19 % E---3.1 exiting
%------------------------------------------------------------------------------