TSTP Solution File: SEU204+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU204+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:14 EDT 2023
% Result : Theorem 0.85s 0.56s
% Output : CNFRefutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 93 ( 14 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 118 ( 46 ~; 50 |; 12 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 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-4 aty)
% Number of variables : 58 ( 3 sgn; 35 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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.zskvYKrKrZ/E---3.1_25607.p',d5_relat_1) ).
fof(d13_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( X3 = relation_image(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5] :
( in(ordered_pair(X5,X4),X1)
& in(X5,X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zskvYKrKrZ/E---3.1_25607.p',d13_relat_1) ).
fof(t144_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_image(X2,X1),relation_rng(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.zskvYKrKrZ/E---3.1_25607.p',t144_relat_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zskvYKrKrZ/E---3.1_25607.p',d3_tarski) ).
fof(c_0_4,plain,
! [X17,X18,X19,X21,X22,X23,X25] :
( ( ~ in(X19,X18)
| in(ordered_pair(esk4_3(X17,X18,X19),X19),X17)
| X18 != relation_rng(X17)
| ~ relation(X17) )
& ( ~ in(ordered_pair(X22,X21),X17)
| in(X21,X18)
| X18 != relation_rng(X17)
| ~ relation(X17) )
& ( ~ in(esk5_2(X17,X23),X23)
| ~ in(ordered_pair(X25,esk5_2(X17,X23)),X17)
| X23 = relation_rng(X17)
| ~ relation(X17) )
& ( in(esk5_2(X17,X23),X23)
| in(ordered_pair(esk6_2(X17,X23),esk5_2(X17,X23)),X17)
| X23 = relation_rng(X17)
| ~ 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)],[d5_relat_1])])])])])]) ).
fof(c_0_5,plain,
! [X29,X30,X31,X32,X34,X35,X36,X37,X39] :
( ( in(ordered_pair(esk7_4(X29,X30,X31,X32),X32),X29)
| ~ in(X32,X31)
| X31 != relation_image(X29,X30)
| ~ relation(X29) )
& ( in(esk7_4(X29,X30,X31,X32),X30)
| ~ in(X32,X31)
| X31 != relation_image(X29,X30)
| ~ relation(X29) )
& ( ~ in(ordered_pair(X35,X34),X29)
| ~ in(X35,X30)
| in(X34,X31)
| X31 != relation_image(X29,X30)
| ~ relation(X29) )
& ( ~ in(esk8_3(X29,X36,X37),X37)
| ~ in(ordered_pair(X39,esk8_3(X29,X36,X37)),X29)
| ~ in(X39,X36)
| X37 = relation_image(X29,X36)
| ~ relation(X29) )
& ( in(ordered_pair(esk9_3(X29,X36,X37),esk8_3(X29,X36,X37)),X29)
| in(esk8_3(X29,X36,X37),X37)
| X37 = relation_image(X29,X36)
| ~ relation(X29) )
& ( in(esk9_3(X29,X36,X37),X36)
| in(esk8_3(X29,X36,X37),X37)
| X37 = relation_image(X29,X36)
| ~ relation(X29) ) ),
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)],[d13_relat_1])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_image(X2,X1),relation_rng(X2)) ),
inference(assume_negation,[status(cth)],[t144_relat_1]) ).
cnf(c_0_7,plain,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(ordered_pair(esk7_4(X1,X2,X3,X4),X4),X1)
| ~ in(X4,X3)
| X3 != relation_image(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
( relation(esk2_0)
& ~ subset(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X8,X9,X10,X11,X12] :
( ( ~ subset(X8,X9)
| ~ in(X10,X8)
| in(X10,X9) )
& ( in(esk3_2(X11,X12),X11)
| subset(X11,X12) )
& ( ~ in(esk3_2(X11,X12),X12)
| subset(X11,X12) ) ),
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])])])])])]) ).
cnf(c_0_11,plain,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(ordered_pair(X3,X1),X2) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( in(ordered_pair(esk7_4(X1,X2,relation_image(X1,X2),X3),X3),X1)
| ~ relation(X1)
| ~ in(X3,relation_image(X1,X2)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ subset(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(X1,relation_image(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
in(esk3_2(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)),relation_image(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
~ in(esk3_2(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)),relation_rng(esk2_0)),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU204+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 08:49:28 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.zskvYKrKrZ/E---3.1_25607.p
% 0.85/0.56 # Version: 3.1pre001
% 0.85/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.85/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.85/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.85/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.85/0.56 # Starting sh5l with 300s (1) cores
% 0.85/0.56 # sh5l with pid 25767 completed with status 0
% 0.85/0.56 # Result found by sh5l
% 0.85/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.85/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.85/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.85/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.85/0.56 # Starting sh5l with 300s (1) cores
% 0.85/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.85/0.56 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.85/0.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.85/0.56 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.85/0.56 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25778 completed with status 0
% 0.85/0.56 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.85/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.85/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.85/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.85/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.85/0.56 # Starting sh5l with 300s (1) cores
% 0.85/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.85/0.56 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.85/0.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.85/0.56 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.85/0.56 # Preprocessing time : 0.002 s
% 0.85/0.56 # Presaturation interreduction done
% 0.85/0.56
% 0.85/0.56 # Proof found!
% 0.85/0.56 # SZS status Theorem
% 0.85/0.56 # SZS output start CNFRefutation
% See solution above
% 0.85/0.56 # Parsed axioms : 40
% 0.85/0.56 # Removed by relevancy pruning/SinE : 8
% 0.85/0.56 # Initial clauses : 50
% 0.85/0.56 # Removed in clause preprocessing : 0
% 0.85/0.56 # Initial clauses in saturation : 50
% 0.85/0.56 # Processed clauses : 908
% 0.85/0.56 # ...of these trivial : 19
% 0.85/0.56 # ...subsumed : 541
% 0.85/0.56 # ...remaining for further processing : 348
% 0.85/0.56 # Other redundant clauses eliminated : 5
% 0.85/0.56 # Clauses deleted for lack of memory : 0
% 0.85/0.56 # Backward-subsumed : 16
% 0.85/0.56 # Backward-rewritten : 16
% 0.85/0.56 # Generated clauses : 2667
% 0.85/0.56 # ...of the previous two non-redundant : 2459
% 0.85/0.56 # ...aggressively subsumed : 0
% 0.85/0.56 # Contextual simplify-reflections : 6
% 0.85/0.56 # Paramodulations : 2662
% 0.85/0.56 # Factorizations : 0
% 0.85/0.56 # NegExts : 0
% 0.85/0.56 # Equation resolutions : 5
% 0.85/0.56 # Total rewrite steps : 1260
% 0.85/0.56 # Propositional unsat checks : 0
% 0.85/0.56 # Propositional check models : 0
% 0.85/0.56 # Propositional check unsatisfiable : 0
% 0.85/0.56 # Propositional clauses : 0
% 0.85/0.56 # Propositional clauses after purity: 0
% 0.85/0.56 # Propositional unsat core size : 0
% 0.85/0.56 # Propositional preprocessing time : 0.000
% 0.85/0.56 # Propositional encoding time : 0.000
% 0.85/0.56 # Propositional solver time : 0.000
% 0.85/0.56 # Success case prop preproc time : 0.000
% 0.85/0.56 # Success case prop encoding time : 0.000
% 0.85/0.56 # Success case prop solver time : 0.000
% 0.85/0.56 # Current number of processed clauses : 262
% 0.85/0.56 # Positive orientable unit clauses : 72
% 0.85/0.56 # Positive unorientable unit clauses: 1
% 0.85/0.56 # Negative unit clauses : 67
% 0.85/0.56 # Non-unit-clauses : 122
% 0.85/0.56 # Current number of unprocessed clauses: 1573
% 0.85/0.56 # ...number of literals in the above : 6296
% 0.85/0.56 # Current number of archived formulas : 0
% 0.85/0.56 # Current number of archived clauses : 81
% 0.85/0.56 # Clause-clause subsumption calls (NU) : 4092
% 0.85/0.56 # Rec. Clause-clause subsumption calls : 2315
% 0.85/0.56 # Non-unit clause-clause subsumptions : 181
% 0.85/0.56 # Unit Clause-clause subsumption calls : 1802
% 0.85/0.56 # Rewrite failures with RHS unbound : 0
% 0.85/0.56 # BW rewrite match attempts : 34
% 0.85/0.56 # BW rewrite match successes : 14
% 0.85/0.56 # Condensation attempts : 0
% 0.85/0.56 # Condensation successes : 0
% 0.85/0.56 # Termbank termtop insertions : 37897
% 0.85/0.56
% 0.85/0.56 # -------------------------------------------------
% 0.85/0.56 # User time : 0.065 s
% 0.85/0.56 # System time : 0.007 s
% 0.85/0.56 # Total time : 0.072 s
% 0.85/0.56 # Maximum resident set size: 1868 pages
% 0.85/0.56
% 0.85/0.56 # -------------------------------------------------
% 0.85/0.56 # User time : 0.067 s
% 0.85/0.56 # System time : 0.009 s
% 0.85/0.56 # Total time : 0.076 s
% 0.85/0.56 # Maximum resident set size: 1700 pages
% 0.85/0.56 % E---3.1 exiting
% 0.85/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------