TSTP Solution File: SEU193+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU193+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:11 EDT 2023
% Result : Theorem 0.14s 0.50s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 100 ( 8 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 128 ( 52 ~; 56 |; 9 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 47 ( 3 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t88_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_dom_restriction(X2,X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.MdqTYkPxSB/E---3.1_9033.p',t88_relat_1) ).
fof(d3_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X1)
=> in(ordered_pair(X3,X4),X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MdqTYkPxSB/E---3.1_9033.p',d3_relat_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.MdqTYkPxSB/E---3.1_9033.p',dt_k7_relat_1) ).
fof(d11_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( relation(X3)
=> ( X3 = relation_dom_restriction(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ( in(X4,X2)
& in(ordered_pair(X4,X5),X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MdqTYkPxSB/E---3.1_9033.p',d11_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_dom_restriction(X2,X1),X2) ),
inference(assume_negation,[status(cth)],[t88_relat_1]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X11] :
( ( ~ subset(X8,X9)
| ~ in(ordered_pair(X10,X11),X8)
| in(ordered_pair(X10,X11),X9)
| ~ relation(X9)
| ~ relation(X8) )
& ( in(ordered_pair(esk3_2(X8,X9),esk4_2(X8,X9)),X8)
| subset(X8,X9)
| ~ relation(X9)
| ~ relation(X8) )
& ( ~ in(ordered_pair(esk3_2(X8,X9),esk4_2(X8,X9)),X9)
| subset(X8,X9)
| ~ relation(X9)
| ~ relation(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_relat_1])])])])]) ).
fof(c_0_6,negated_conjecture,
( relation(esk2_0)
& ~ subset(relation_dom_restriction(esk2_0,esk1_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( in(ordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),X1)
| subset(X1,X2)
| ~ relation(X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X26,X27] :
( ~ relation(X26)
| relation(relation_dom_restriction(X26,X27)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])]) ).
cnf(c_0_10,negated_conjecture,
( subset(X1,esk2_0)
| in(ordered_pair(esk3_2(X1,esk2_0),esk4_2(X1,esk2_0)),X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X17,X18,X19,X20,X21,X22,X23] :
( ( in(X20,X18)
| ~ in(ordered_pair(X20,X21),X19)
| X19 != relation_dom_restriction(X17,X18)
| ~ relation(X19)
| ~ relation(X17) )
& ( in(ordered_pair(X20,X21),X17)
| ~ in(ordered_pair(X20,X21),X19)
| X19 != relation_dom_restriction(X17,X18)
| ~ relation(X19)
| ~ relation(X17) )
& ( ~ in(X22,X18)
| ~ in(ordered_pair(X22,X23),X17)
| in(ordered_pair(X22,X23),X19)
| X19 != relation_dom_restriction(X17,X18)
| ~ relation(X19)
| ~ relation(X17) )
& ( ~ in(ordered_pair(esk5_3(X17,X18,X19),esk6_3(X17,X18,X19)),X19)
| ~ in(esk5_3(X17,X18,X19),X18)
| ~ in(ordered_pair(esk5_3(X17,X18,X19),esk6_3(X17,X18,X19)),X17)
| X19 = relation_dom_restriction(X17,X18)
| ~ relation(X19)
| ~ relation(X17) )
& ( in(esk5_3(X17,X18,X19),X18)
| in(ordered_pair(esk5_3(X17,X18,X19),esk6_3(X17,X18,X19)),X19)
| X19 = relation_dom_restriction(X17,X18)
| ~ relation(X19)
| ~ relation(X17) )
& ( in(ordered_pair(esk5_3(X17,X18,X19),esk6_3(X17,X18,X19)),X17)
| in(ordered_pair(esk5_3(X17,X18,X19),esk6_3(X17,X18,X19)),X19)
| X19 = relation_dom_restriction(X17,X18)
| ~ relation(X19)
| ~ relation(X17) ) ),
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)],[d11_relat_1])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( subset(relation_dom_restriction(X1,X2),esk2_0)
| in(ordered_pair(esk3_2(relation_dom_restriction(X1,X2),esk2_0),esk4_2(relation_dom_restriction(X1,X2),esk2_0)),relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( in(ordered_pair(X1,X2),X3)
| ~ in(ordered_pair(X1,X2),X4)
| X4 != relation_dom_restriction(X3,X5)
| ~ relation(X4)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ subset(relation_dom_restriction(esk2_0,esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( subset(relation_dom_restriction(esk2_0,X1),esk2_0)
| in(ordered_pair(esk3_2(relation_dom_restriction(esk2_0,X1),esk2_0),esk4_2(relation_dom_restriction(esk2_0,X1),esk2_0)),relation_dom_restriction(esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ~ in(ordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),X2)
| ~ relation(X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( in(ordered_pair(X1,X2),X3)
| ~ relation(X3)
| ~ in(ordered_pair(X1,X2),relation_dom_restriction(X3,X4)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_11]) ).
cnf(c_0_19,negated_conjecture,
in(ordered_pair(esk3_2(relation_dom_restriction(esk2_0,esk1_0),esk2_0),esk4_2(relation_dom_restriction(esk2_0,esk1_0),esk2_0)),relation_dom_restriction(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( ~ relation(relation_dom_restriction(esk2_0,esk1_0))
| ~ in(ordered_pair(esk3_2(relation_dom_restriction(esk2_0,esk1_0),esk2_0),esk4_2(relation_dom_restriction(esk2_0,esk1_0),esk2_0)),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_8])]) ).
cnf(c_0_21,negated_conjecture,
in(ordered_pair(esk3_2(relation_dom_restriction(esk2_0,esk1_0),esk2_0),esk4_2(relation_dom_restriction(esk2_0,esk1_0),esk2_0)),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_8])]) ).
cnf(c_0_22,negated_conjecture,
~ relation(relation_dom_restriction(esk2_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_11]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEU193+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n031.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 09:43:28 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.MdqTYkPxSB/E---3.1_9033.p
% 0.14/0.50 # Version: 3.1pre001
% 0.14/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 # Starting sh5l with 300s (1) cores
% 0.14/0.50 # sh5l with pid 9115 completed with status 0
% 0.14/0.50 # Result found by sh5l
% 0.14/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 # Starting sh5l with 300s (1) cores
% 0.14/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.50 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.50 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.50 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.14/0.50 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9120 completed with status 0
% 0.14/0.50 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 # Starting sh5l with 300s (1) cores
% 0.14/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.50 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.50 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.50 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.14/0.50 # Preprocessing time : 0.001 s
% 0.14/0.50 # Presaturation interreduction done
% 0.14/0.50
% 0.14/0.50 # Proof found!
% 0.14/0.50 # SZS status Theorem
% 0.14/0.50 # SZS output start CNFRefutation
% See solution above
% 0.14/0.50 # Parsed axioms : 36
% 0.14/0.50 # Removed by relevancy pruning/SinE : 6
% 0.14/0.50 # Initial clauses : 44
% 0.14/0.50 # Removed in clause preprocessing : 0
% 0.14/0.50 # Initial clauses in saturation : 44
% 0.14/0.50 # Processed clauses : 842
% 0.14/0.50 # ...of these trivial : 77
% 0.14/0.50 # ...subsumed : 293
% 0.14/0.50 # ...remaining for further processing : 472
% 0.14/0.50 # Other redundant clauses eliminated : 3
% 0.14/0.50 # Clauses deleted for lack of memory : 0
% 0.14/0.50 # Backward-subsumed : 21
% 0.14/0.50 # Backward-rewritten : 24
% 0.14/0.50 # Generated clauses : 4828
% 0.14/0.50 # ...of the previous two non-redundant : 2918
% 0.14/0.50 # ...aggressively subsumed : 0
% 0.14/0.50 # Contextual simplify-reflections : 17
% 0.14/0.50 # Paramodulations : 4820
% 0.14/0.50 # Factorizations : 4
% 0.14/0.50 # NegExts : 0
% 0.14/0.50 # Equation resolutions : 3
% 0.14/0.50 # Total rewrite steps : 2299
% 0.14/0.50 # Propositional unsat checks : 0
% 0.14/0.50 # Propositional check models : 0
% 0.14/0.50 # Propositional check unsatisfiable : 0
% 0.14/0.50 # Propositional clauses : 0
% 0.14/0.50 # Propositional clauses after purity: 0
% 0.14/0.50 # Propositional unsat core size : 0
% 0.14/0.50 # Propositional preprocessing time : 0.000
% 0.14/0.50 # Propositional encoding time : 0.000
% 0.14/0.50 # Propositional solver time : 0.000
% 0.14/0.50 # Success case prop preproc time : 0.000
% 0.14/0.50 # Success case prop encoding time : 0.000
% 0.14/0.50 # Success case prop solver time : 0.000
% 0.14/0.50 # Current number of processed clauses : 380
% 0.14/0.50 # Positive orientable unit clauses : 107
% 0.14/0.50 # Positive unorientable unit clauses: 2
% 0.14/0.50 # Negative unit clauses : 87
% 0.14/0.50 # Non-unit-clauses : 184
% 0.14/0.50 # Current number of unprocessed clauses: 2016
% 0.14/0.50 # ...number of literals in the above : 7041
% 0.14/0.50 # Current number of archived formulas : 0
% 0.14/0.50 # Current number of archived clauses : 89
% 0.14/0.50 # Clause-clause subsumption calls (NU) : 8563
% 0.14/0.50 # Rec. Clause-clause subsumption calls : 5140
% 0.14/0.50 # Non-unit clause-clause subsumptions : 155
% 0.14/0.50 # Unit Clause-clause subsumption calls : 3009
% 0.14/0.50 # Rewrite failures with RHS unbound : 0
% 0.14/0.50 # BW rewrite match attempts : 123
% 0.14/0.50 # BW rewrite match successes : 19
% 0.14/0.50 # Condensation attempts : 0
% 0.14/0.50 # Condensation successes : 0
% 0.14/0.50 # Termbank termtop insertions : 69715
% 0.14/0.50
% 0.14/0.50 # -------------------------------------------------
% 0.14/0.50 # User time : 0.083 s
% 0.14/0.50 # System time : 0.002 s
% 0.14/0.50 # Total time : 0.085 s
% 0.14/0.50 # Maximum resident set size: 1856 pages
% 0.14/0.50
% 0.14/0.50 # -------------------------------------------------
% 0.14/0.50 # User time : 0.084 s
% 0.14/0.50 # System time : 0.003 s
% 0.14/0.50 # Total time : 0.088 s
% 0.14/0.50 # Maximum resident set size: 1700 pages
% 0.14/0.50 % E---3.1 exiting
% 0.14/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------