TSTP Solution File: SEU179+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU179+1 : TPTP v8.1.2. Released v3.3.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:30:46 EDT 2023
% Result : Theorem 0.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 7 unt; 0 def)
% Number of atoms : 123 ( 14 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 149 ( 61 ~; 61 |; 13 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 2 con; 0-3 aty)
% Number of variables : 70 ( 4 sgn; 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
=> ( subset(relation_dom(X1),relation_dom(X2))
& subset(relation_rng(X1),relation_rng(X2)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JLY0qPOVj9/E---3.1_26530.p',t25_relat_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JLY0qPOVj9/E---3.1_26530.p',d3_tarski) ).
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.JLY0qPOVj9/E---3.1_26530.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.JLY0qPOVj9/E---3.1_26530.p',d4_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
=> ( subset(relation_dom(X1),relation_dom(X2))
& subset(relation_rng(X1),relation_rng(X2)) ) ) ) ),
inference(assume_negation,[status(cth)],[t25_relat_1]) ).
fof(c_0_5,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ in(X9,X7)
| in(X9,X8) )
& ( in(esk3_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ in(esk3_2(X10,X11),X11)
| subset(X10,X11) ) ),
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)],[d3_tarski])])])])])]) ).
fof(c_0_6,negated_conjecture,
( relation(esk1_0)
& relation(esk2_0)
& subset(esk1_0,esk2_0)
& ( ~ subset(relation_dom(esk1_0),relation_dom(esk2_0))
| ~ subset(relation_rng(esk1_0),relation_rng(esk2_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X16,X17,X18,X20,X21,X22,X24] :
( ( ~ in(X18,X17)
| in(ordered_pair(esk4_3(X16,X17,X18),X18),X16)
| X17 != relation_rng(X16)
| ~ relation(X16) )
& ( ~ in(ordered_pair(X21,X20),X16)
| in(X20,X17)
| X17 != relation_rng(X16)
| ~ relation(X16) )
& ( ~ in(esk5_2(X16,X22),X22)
| ~ in(ordered_pair(X24,esk5_2(X16,X22)),X16)
| X22 = relation_rng(X16)
| ~ relation(X16) )
& ( in(esk5_2(X16,X22),X22)
| in(ordered_pair(esk6_2(X16,X22),esk5_2(X16,X22)),X16)
| X22 = relation_rng(X16)
| ~ relation(X16) ) ),
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_8,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(ordered_pair(esk4_3(X3,X2,X1),X1),X3)
| ~ in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X26,X27,X28,X30,X31,X32,X34] :
( ( ~ in(X28,X27)
| in(ordered_pair(X28,esk7_3(X26,X27,X28)),X26)
| X27 != relation_dom(X26)
| ~ relation(X26) )
& ( ~ in(ordered_pair(X30,X31),X26)
| in(X30,X27)
| X27 != relation_dom(X26)
| ~ relation(X26) )
& ( ~ in(esk8_2(X26,X32),X32)
| ~ in(ordered_pair(esk8_2(X26,X32),X34),X26)
| X32 = relation_dom(X26)
| ~ relation(X26) )
& ( in(esk8_2(X26,X32),X32)
| in(ordered_pair(esk8_2(X26,X32),esk9_2(X26,X32)),X26)
| X32 = relation_dom(X26)
| ~ relation(X26) ) ),
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_12,plain,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( in(ordered_pair(esk4_3(X1,relation_rng(X1),X2),X2),X1)
| ~ relation(X1)
| ~ in(X2,relation_rng(X1)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( in(ordered_pair(X1,esk7_3(X3,X2,X1)),X3)
| ~ in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(ordered_pair(X3,X1),X2) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( in(ordered_pair(esk4_3(esk1_0,relation_rng(esk1_0),X1),X1),esk2_0)
| ~ in(X1,relation_rng(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( ~ subset(relation_dom(esk1_0),relation_dom(esk2_0))
| ~ subset(relation_rng(esk1_0),relation_rng(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( in(X1,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( in(ordered_pair(X1,esk7_3(X2,relation_dom(X2),X1)),X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( in(X1,relation_rng(esk2_0))
| ~ in(X1,relation_rng(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_26,negated_conjecture,
( in(esk3_2(relation_rng(esk1_0),relation_rng(esk2_0)),relation_rng(esk1_0))
| ~ subset(relation_dom(esk1_0),relation_dom(esk2_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( ~ subset(relation_dom(esk1_0),relation_dom(esk2_0))
| ~ in(esk3_2(relation_rng(esk1_0),relation_rng(esk2_0)),relation_rng(esk2_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_28,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(ordered_pair(X1,X3),X2) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( in(ordered_pair(X1,esk7_3(esk1_0,relation_dom(esk1_0),X1)),esk2_0)
| ~ in(X1,relation_dom(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_24]),c_0_15])]) ).
cnf(c_0_30,negated_conjecture,
~ subset(relation_dom(esk1_0),relation_dom(esk2_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( in(X1,relation_dom(esk2_0))
| ~ in(X1,relation_dom(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_19])]) ).
cnf(c_0_32,negated_conjecture,
in(esk3_2(relation_dom(esk1_0),relation_dom(esk2_0)),relation_dom(esk1_0)),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_33,negated_conjecture,
~ in(esk3_2(relation_dom(esk1_0),relation_dom(esk2_0)),relation_dom(esk2_0)),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU179+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 08:37:51 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.JLY0qPOVj9/E---3.1_26530.p
% 0.16/0.48 # Version: 3.1pre001
% 0.16/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 # Starting sh5l with 300s (1) cores
% 0.16/0.48 # new_bool_1 with pid 26609 completed with status 0
% 0.16/0.48 # Result found by new_bool_1
% 0.16/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.48 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.48 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.16/0.48 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26611 completed with status 0
% 0.16/0.48 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.48 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.48 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.16/0.48 # Preprocessing time : 0.001 s
% 0.16/0.48 # Presaturation interreduction done
% 0.16/0.48
% 0.16/0.48 # Proof found!
% 0.16/0.48 # SZS status Theorem
% 0.16/0.48 # SZS output start CNFRefutation
% See solution above
% 0.16/0.48 # Parsed axioms : 35
% 0.16/0.48 # Removed by relevancy pruning/SinE : 14
% 0.16/0.48 # Initial clauses : 36
% 0.16/0.48 # Removed in clause preprocessing : 0
% 0.16/0.48 # Initial clauses in saturation : 36
% 0.16/0.48 # Processed clauses : 641
% 0.16/0.48 # ...of these trivial : 7
% 0.16/0.48 # ...subsumed : 311
% 0.16/0.48 # ...remaining for further processing : 323
% 0.16/0.48 # Other redundant clauses eliminated : 4
% 0.16/0.48 # Clauses deleted for lack of memory : 0
% 0.16/0.48 # Backward-subsumed : 46
% 0.16/0.48 # Backward-rewritten : 22
% 0.16/0.48 # Generated clauses : 1924
% 0.16/0.48 # ...of the previous two non-redundant : 1844
% 0.16/0.48 # ...aggressively subsumed : 0
% 0.16/0.48 # Contextual simplify-reflections : 4
% 0.16/0.48 # Paramodulations : 1920
% 0.16/0.48 # Factorizations : 0
% 0.16/0.48 # NegExts : 0
% 0.16/0.48 # Equation resolutions : 4
% 0.16/0.48 # Total rewrite steps : 680
% 0.16/0.48 # Propositional unsat checks : 0
% 0.16/0.48 # Propositional check models : 0
% 0.16/0.48 # Propositional check unsatisfiable : 0
% 0.16/0.48 # Propositional clauses : 0
% 0.16/0.48 # Propositional clauses after purity: 0
% 0.16/0.48 # Propositional unsat core size : 0
% 0.16/0.48 # Propositional preprocessing time : 0.000
% 0.16/0.48 # Propositional encoding time : 0.000
% 0.16/0.48 # Propositional solver time : 0.000
% 0.16/0.48 # Success case prop preproc time : 0.000
% 0.16/0.48 # Success case prop encoding time : 0.000
% 0.16/0.48 # Success case prop solver time : 0.000
% 0.16/0.48 # Current number of processed clauses : 215
% 0.16/0.48 # Positive orientable unit clauses : 53
% 0.16/0.48 # Positive unorientable unit clauses: 0
% 0.16/0.48 # Negative unit clauses : 45
% 0.16/0.48 # Non-unit-clauses : 117
% 0.16/0.48 # Current number of unprocessed clauses: 1202
% 0.16/0.48 # ...number of literals in the above : 4913
% 0.16/0.48 # Current number of archived formulas : 0
% 0.16/0.48 # Current number of archived clauses : 104
% 0.16/0.48 # Clause-clause subsumption calls (NU) : 2809
% 0.16/0.48 # Rec. Clause-clause subsumption calls : 1675
% 0.16/0.48 # Non-unit clause-clause subsumptions : 96
% 0.16/0.48 # Unit Clause-clause subsumption calls : 1117
% 0.16/0.48 # Rewrite failures with RHS unbound : 0
% 0.16/0.48 # BW rewrite match attempts : 42
% 0.16/0.48 # BW rewrite match successes : 10
% 0.16/0.48 # Condensation attempts : 0
% 0.16/0.48 # Condensation successes : 0
% 0.16/0.48 # Termbank termtop insertions : 33361
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.044 s
% 0.16/0.48 # System time : 0.004 s
% 0.16/0.48 # Total time : 0.049 s
% 0.16/0.48 # Maximum resident set size: 1844 pages
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.045 s
% 0.16/0.48 # System time : 0.007 s
% 0.16/0.48 # Total time : 0.051 s
% 0.16/0.48 # Maximum resident set size: 1704 pages
% 0.16/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------