TSTP Solution File: SEU165+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU165+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Sat May 4 09:25:25 EDT 2024
% Result : Theorem 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 47 ( 19 ~; 18 |; 7 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 4 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t106_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wi7lpI4VDD/E---3.1_22356.p',t106_zfmisc_1) ).
fof(l55_zfmisc_1,lemma,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wi7lpI4VDD/E---3.1_22356.p',l55_zfmisc_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
inference(assume_negation,[status(cth)],[t106_zfmisc_1]) ).
fof(c_0_3,lemma,
! [X39,X40,X41,X42] :
( ( in(X39,X41)
| ~ in(ordered_pair(X39,X40),cartesian_product2(X41,X42)) )
& ( in(X40,X42)
| ~ in(ordered_pair(X39,X40),cartesian_product2(X41,X42)) )
& ( ~ in(X39,X41)
| ~ in(X40,X42)
| in(ordered_pair(X39,X40),cartesian_product2(X41,X42)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l55_zfmisc_1])])])]) ).
fof(c_0_4,negated_conjecture,
( ( ~ in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| ~ in(esk1_0,esk3_0)
| ~ in(esk2_0,esk4_0) )
& ( in(esk1_0,esk3_0)
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) )
& ( in(esk2_0,esk4_0)
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_5,lemma,
( in(X1,X2)
| ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( in(esk2_0,esk4_0)
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| ~ in(esk1_0,esk3_0)
| ~ in(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
in(esk2_0,esk4_0),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,lemma,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( in(esk1_0,esk3_0)
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,lemma,
( in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| ~ in(X1,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( ~ in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| ~ in(esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_13,negated_conjecture,
in(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( in(ordered_pair(X1,esk2_0),cartesian_product2(X2,esk4_0))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
~ in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.08 % Problem : SEU165+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.09 % Command : run_E %s %d THM
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Fri May 3 08:01:39 EDT 2024
% 0.08/0.27 % CPUTime :
% 0.12/0.36 Running first-order theorem proving
% 0.12/0.36 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.wi7lpI4VDD/E---3.1_22356.p
% 0.12/0.39 # Version: 3.1.0
% 0.12/0.39 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.39 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.39 # Starting sh5l with 300s (1) cores
% 0.12/0.39 # new_bool_3 with pid 22478 completed with status 0
% 0.12/0.39 # Result found by new_bool_3
% 0.12/0.39 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.39 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.39 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.12/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.39 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.12/0.39 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 22482 completed with status 0
% 0.12/0.39 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.12/0.39 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.39 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.39 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.12/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.39 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.12/0.39 # Preprocessing time : 0.002 s
% 0.12/0.39 # Presaturation interreduction done
% 0.12/0.39
% 0.12/0.39 # Proof found!
% 0.12/0.39 # SZS status Theorem
% 0.12/0.39 # SZS output start CNFRefutation
% See solution above
% 0.12/0.39 # Parsed axioms : 95
% 0.12/0.39 # Removed by relevancy pruning/SinE : 35
% 0.12/0.39 # Initial clauses : 107
% 0.12/0.39 # Removed in clause preprocessing : 0
% 0.12/0.40 # Initial clauses in saturation : 107
% 0.12/0.40 # Processed clauses : 476
% 0.12/0.40 # ...of these trivial : 8
% 0.12/0.40 # ...subsumed : 180
% 0.12/0.40 # ...remaining for further processing : 288
% 0.12/0.40 # Other redundant clauses eliminated : 28
% 0.12/0.40 # Clauses deleted for lack of memory : 0
% 0.12/0.40 # Backward-subsumed : 12
% 0.12/0.40 # Backward-rewritten : 19
% 0.12/0.40 # Generated clauses : 691
% 0.12/0.40 # ...of the previous two non-redundant : 551
% 0.12/0.40 # ...aggressively subsumed : 0
% 0.12/0.40 # Contextual simplify-reflections : 2
% 0.12/0.40 # Paramodulations : 663
% 0.12/0.40 # Factorizations : 0
% 0.12/0.40 # NegExts : 0
% 0.12/0.40 # Equation resolutions : 32
% 0.12/0.40 # Disequality decompositions : 0
% 0.12/0.40 # Total rewrite steps : 181
% 0.12/0.40 # ...of those cached : 119
% 0.12/0.40 # Propositional unsat checks : 0
% 0.12/0.40 # Propositional check models : 0
% 0.12/0.40 # Propositional check unsatisfiable : 0
% 0.12/0.40 # Propositional clauses : 0
% 0.12/0.40 # Propositional clauses after purity: 0
% 0.12/0.40 # Propositional unsat core size : 0
% 0.12/0.40 # Propositional preprocessing time : 0.000
% 0.12/0.40 # Propositional encoding time : 0.000
% 0.12/0.40 # Propositional solver time : 0.000
% 0.12/0.40 # Success case prop preproc time : 0.000
% 0.12/0.40 # Success case prop encoding time : 0.000
% 0.12/0.40 # Success case prop solver time : 0.000
% 0.12/0.40 # Current number of processed clauses : 142
% 0.12/0.40 # Positive orientable unit clauses : 46
% 0.12/0.40 # Positive unorientable unit clauses: 3
% 0.12/0.40 # Negative unit clauses : 36
% 0.12/0.40 # Non-unit-clauses : 57
% 0.12/0.40 # Current number of unprocessed clauses: 261
% 0.12/0.40 # ...number of literals in the above : 491
% 0.12/0.40 # Current number of archived formulas : 0
% 0.12/0.40 # Current number of archived clauses : 124
% 0.12/0.40 # Clause-clause subsumption calls (NU) : 1188
% 0.12/0.40 # Rec. Clause-clause subsumption calls : 882
% 0.12/0.40 # Non-unit clause-clause subsumptions : 23
% 0.12/0.40 # Unit Clause-clause subsumption calls : 627
% 0.12/0.40 # Rewrite failures with RHS unbound : 0
% 0.12/0.40 # BW rewrite match attempts : 81
% 0.12/0.40 # BW rewrite match successes : 54
% 0.12/0.40 # Condensation attempts : 0
% 0.12/0.40 # Condensation successes : 0
% 0.12/0.40 # Termbank termtop insertions : 11770
% 0.12/0.40 # Search garbage collected termcells : 1735
% 0.12/0.40
% 0.12/0.40 # -------------------------------------------------
% 0.12/0.40 # User time : 0.026 s
% 0.12/0.40 # System time : 0.002 s
% 0.12/0.40 # Total time : 0.028 s
% 0.12/0.40 # Maximum resident set size: 2084 pages
% 0.12/0.40
% 0.12/0.40 # -------------------------------------------------
% 0.12/0.40 # User time : 0.028 s
% 0.12/0.40 # System time : 0.005 s
% 0.12/0.40 # Total time : 0.032 s
% 0.12/0.40 # Maximum resident set size: 1776 pages
% 0.12/0.40 % E---3.1 exiting
% 0.12/0.40 % E exiting
%------------------------------------------------------------------------------