TSTP Solution File: SEU177+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU177+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:30:45 EDT 2023
% Result : Theorem 0.54s 0.53s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 81 ( 19 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 92 ( 36 ~; 36 |; 10 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 56 ( 3 sgn; 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/tmp/tmp.QdI7eiGReH/E---3.1_25601.p',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.QdI7eiGReH/E---3.1_25601.p',commutativity_k2_tarski) ).
fof(t20_relat_1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QdI7eiGReH/E---3.1_25601.p',t20_relat_1) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QdI7eiGReH/E---3.1_25601.p',d5_relat_1) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QdI7eiGReH/E---3.1_25601.p',d4_relat_1) ).
fof(c_0_5,plain,
! [X59,X60] : ordered_pair(X59,X60) = unordered_pair(unordered_pair(X59,X60),singleton(X59)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_6,plain,
! [X78,X79] : unordered_pair(X78,X79) = unordered_pair(X79,X78),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
inference(assume_negation,[status(cth)],[t20_relat_1]) ).
fof(c_0_8,plain,
! [X39,X40,X41,X43,X44,X45,X47] :
( ( ~ in(X41,X40)
| in(ordered_pair(esk8_3(X39,X40,X41),X41),X39)
| X40 != relation_rng(X39)
| ~ relation(X39) )
& ( ~ in(ordered_pair(X44,X43),X39)
| in(X43,X40)
| X40 != relation_rng(X39)
| ~ relation(X39) )
& ( ~ in(esk9_2(X39,X45),X45)
| ~ in(ordered_pair(X47,esk9_2(X39,X45)),X39)
| X45 = relation_rng(X39)
| ~ relation(X39) )
& ( in(esk9_2(X39,X45),X45)
| in(ordered_pair(esk10_2(X39,X45),esk9_2(X39,X45)),X39)
| X45 = relation_rng(X39)
| ~ relation(X39) ) ),
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)],[d5_relat_1])])])])])]) ).
cnf(c_0_9,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( relation(esk3_0)
& in(ordered_pair(esk1_0,esk2_0),esk3_0)
& ( ~ in(esk1_0,relation_dom(esk3_0))
| ~ in(esk2_0,relation_rng(esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
in(ordered_pair(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X49,X50,X51,X53,X54,X55,X57] :
( ( ~ in(X51,X50)
| in(ordered_pair(X51,esk11_3(X49,X50,X51)),X49)
| X50 != relation_dom(X49)
| ~ relation(X49) )
& ( ~ in(ordered_pair(X53,X54),X49)
| in(X53,X50)
| X50 != relation_dom(X49)
| ~ relation(X49) )
& ( ~ in(esk12_2(X49,X55),X55)
| ~ in(ordered_pair(esk12_2(X49,X55),X57),X49)
| X55 = relation_dom(X49)
| ~ relation(X49) )
& ( in(esk12_2(X49,X55),X55)
| in(ordered_pair(esk12_2(X49,X55),esk13_2(X49,X55)),X49)
| X55 = relation_dom(X49)
| ~ relation(X49) ) ),
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)],[d4_relat_1])])])])])]) ).
cnf(c_0_16,plain,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),X2) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
in(unordered_pair(singleton(esk1_0),unordered_pair(esk1_0,esk2_0)),esk3_0),
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( in(X1,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ in(esk1_0,relation_dom(esk3_0))
| ~ in(esk2_0,relation_rng(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
in(esk2_0,relation_rng(esk3_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,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_13])]) ).
cnf(c_0_23,negated_conjecture,
~ in(esk1_0,relation_dom(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_18])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU177+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 09:27:59 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.QdI7eiGReH/E---3.1_25601.p
% 0.54/0.53 # Version: 3.1pre001
% 0.54/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.53 # Starting sh5l with 300s (1) cores
% 0.54/0.53 # new_bool_1 with pid 25680 completed with status 0
% 0.54/0.53 # Result found by new_bool_1
% 0.54/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.53 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.54/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.53 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.54/0.53 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25682 completed with status 0
% 0.54/0.53 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.54/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.53 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.54/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.53 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.54/0.53 # Preprocessing time : 0.002 s
% 0.54/0.53 # Presaturation interreduction done
% 0.54/0.53
% 0.54/0.53 # Proof found!
% 0.54/0.53 # SZS status Theorem
% 0.54/0.53 # SZS output start CNFRefutation
% See solution above
% 0.54/0.53 # Parsed axioms : 142
% 0.54/0.53 # Removed by relevancy pruning/SinE : 66
% 0.54/0.53 # Initial clauses : 131
% 0.54/0.53 # Removed in clause preprocessing : 0
% 0.54/0.53 # Initial clauses in saturation : 131
% 0.54/0.53 # Processed clauses : 578
% 0.54/0.53 # ...of these trivial : 2
% 0.54/0.53 # ...subsumed : 221
% 0.54/0.53 # ...remaining for further processing : 355
% 0.54/0.53 # Other redundant clauses eliminated : 32
% 0.54/0.53 # Clauses deleted for lack of memory : 0
% 0.54/0.53 # Backward-subsumed : 2
% 0.54/0.53 # Backward-rewritten : 25
% 0.54/0.53 # Generated clauses : 860
% 0.54/0.53 # ...of the previous two non-redundant : 709
% 0.54/0.53 # ...aggressively subsumed : 0
% 0.54/0.53 # Contextual simplify-reflections : 0
% 0.54/0.53 # Paramodulations : 827
% 0.54/0.53 # Factorizations : 0
% 0.54/0.53 # NegExts : 0
% 0.54/0.53 # Equation resolutions : 36
% 0.54/0.53 # Total rewrite steps : 235
% 0.54/0.53 # Propositional unsat checks : 0
% 0.54/0.53 # Propositional check models : 0
% 0.54/0.53 # Propositional check unsatisfiable : 0
% 0.54/0.53 # Propositional clauses : 0
% 0.54/0.53 # Propositional clauses after purity: 0
% 0.54/0.53 # Propositional unsat core size : 0
% 0.54/0.53 # Propositional preprocessing time : 0.000
% 0.54/0.53 # Propositional encoding time : 0.000
% 0.54/0.53 # Propositional solver time : 0.000
% 0.54/0.53 # Success case prop preproc time : 0.000
% 0.54/0.53 # Success case prop encoding time : 0.000
% 0.54/0.53 # Success case prop solver time : 0.000
% 0.54/0.53 # Current number of processed clauses : 189
% 0.54/0.53 # Positive orientable unit clauses : 50
% 0.54/0.53 # Positive unorientable unit clauses: 2
% 0.54/0.53 # Negative unit clauses : 30
% 0.54/0.53 # Non-unit-clauses : 107
% 0.54/0.53 # Current number of unprocessed clauses: 364
% 0.54/0.53 # ...number of literals in the above : 807
% 0.54/0.53 # Current number of archived formulas : 0
% 0.54/0.53 # Current number of archived clauses : 142
% 0.54/0.53 # Clause-clause subsumption calls (NU) : 2697
% 0.54/0.53 # Rec. Clause-clause subsumption calls : 2048
% 0.54/0.53 # Non-unit clause-clause subsumptions : 90
% 0.54/0.53 # Unit Clause-clause subsumption calls : 478
% 0.54/0.53 # Rewrite failures with RHS unbound : 0
% 0.54/0.53 # BW rewrite match attempts : 80
% 0.54/0.53 # BW rewrite match successes : 58
% 0.54/0.53 # Condensation attempts : 0
% 0.54/0.53 # Condensation successes : 0
% 0.54/0.53 # Termbank termtop insertions : 14220
% 0.54/0.53
% 0.54/0.53 # -------------------------------------------------
% 0.54/0.53 # User time : 0.026 s
% 0.54/0.53 # System time : 0.004 s
% 0.54/0.53 # Total time : 0.031 s
% 0.54/0.53 # Maximum resident set size: 2196 pages
% 0.54/0.53
% 0.54/0.53 # -------------------------------------------------
% 0.54/0.53 # User time : 0.029 s
% 0.54/0.53 # System time : 0.007 s
% 0.54/0.53 # Total time : 0.036 s
% 0.54/0.53 # Maximum resident set size: 1812 pages
% 0.54/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------