TSTP Solution File: SEU239+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU239+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:31:00 EDT 2024
% Result : Theorem 5.39s 1.20s
% Output : CNFRefutation 5.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 88 ( 34 ~; 37 |; 6 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l1_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> ! [X2] :
( in(X2,relation_field(X1))
=> in(ordered_pair(X2,X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NWotG1OmEY/E---3.1_11679.p',l1_wellord1) ).
fof(d1_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_reflexive_in(X1,X2)
<=> ! [X3] :
( in(X3,X2)
=> in(ordered_pair(X3,X3),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NWotG1OmEY/E---3.1_11679.p',d1_relat_2) ).
fof(d9_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> is_reflexive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.NWotG1OmEY/E---3.1_11679.p',d9_relat_2) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> ! [X2] :
( in(X2,relation_field(X1))
=> in(ordered_pair(X2,X2),X1) ) ) ),
inference(assume_negation,[status(cth)],[l1_wellord1]) ).
fof(c_0_4,negated_conjecture,
! [X9] :
( relation(esk1_0)
& ( in(esk2_0,relation_field(esk1_0))
| ~ reflexive(esk1_0) )
& ( ~ in(ordered_pair(esk2_0,esk2_0),esk1_0)
| ~ reflexive(esk1_0) )
& ( reflexive(esk1_0)
| ~ in(X9,relation_field(esk1_0))
| in(ordered_pair(X9,X9),esk1_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
fof(c_0_5,plain,
! [X615,X616,X617,X618] :
( ( ~ is_reflexive_in(X615,X616)
| ~ in(X617,X616)
| in(ordered_pair(X617,X617),X615)
| ~ relation(X615) )
& ( in(esk84_2(X615,X618),X618)
| is_reflexive_in(X615,X618)
| ~ relation(X615) )
& ( ~ in(ordered_pair(esk84_2(X615,X618),esk84_2(X615,X618)),X615)
| is_reflexive_in(X615,X618)
| ~ relation(X615) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[d1_relat_2])])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( reflexive(esk1_0)
| in(ordered_pair(X1,X1),esk1_0)
| ~ in(X1,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( in(esk84_2(X1,X2),X2)
| is_reflexive_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X249] :
( ( ~ reflexive(X249)
| is_reflexive_in(X249,relation_field(X249))
| ~ relation(X249) )
& ( ~ is_reflexive_in(X249,relation_field(X249))
| reflexive(X249)
| ~ relation(X249) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_relat_2])])])]) ).
cnf(c_0_9,plain,
( is_reflexive_in(X1,X2)
| ~ in(ordered_pair(esk84_2(X1,X2),esk84_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( reflexive(esk1_0)
| is_reflexive_in(X1,relation_field(esk1_0))
| in(ordered_pair(esk84_2(X1,relation_field(esk1_0)),esk84_2(X1,relation_field(esk1_0))),esk1_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( reflexive(X1)
| ~ is_reflexive_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( reflexive(esk1_0)
| is_reflexive_in(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,plain,
( in(ordered_pair(X3,X3),X1)
| ~ is_reflexive_in(X1,X2)
| ~ in(X3,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( is_reflexive_in(X1,relation_field(X1))
| ~ reflexive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( in(esk2_0,relation_field(esk1_0))
| ~ reflexive(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
reflexive(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(ordered_pair(esk2_0,esk2_0),esk1_0)
| ~ reflexive(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,plain,
( in(ordered_pair(X1,X1),X2)
| ~ reflexive(X2)
| ~ relation(X2)
| ~ in(X1,relation_field(X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
in(esk2_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
~ in(ordered_pair(esk2_0,esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_11])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU239+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n019.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 : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 07:48:14 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.NWotG1OmEY/E---3.1_11679.p
% 5.39/1.20 # Version: 3.1.0
% 5.39/1.20 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.39/1.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/1.20 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.39/1.20 # Starting new_bool_3 with 300s (1) cores
% 5.39/1.20 # Starting new_bool_1 with 300s (1) cores
% 5.39/1.20 # Starting sh5l with 300s (1) cores
% 5.39/1.20 # sh5l with pid 11760 completed with status 0
% 5.39/1.20 # Result found by sh5l
% 5.39/1.20 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.39/1.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/1.20 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.39/1.20 # Starting new_bool_3 with 300s (1) cores
% 5.39/1.20 # Starting new_bool_1 with 300s (1) cores
% 5.39/1.20 # Starting sh5l with 300s (1) cores
% 5.39/1.20 # SinE strategy is gf500_gu_R04_F100_L20000
% 5.39/1.20 # Search class: FGHSM-FSLM32-MFFFFFNN
% 5.39/1.20 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 5.39/1.20 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 5.39/1.20 # G-E--_303_C18_F1_URBAN_S0Y with pid 11763 completed with status 0
% 5.39/1.20 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 5.39/1.20 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.39/1.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/1.20 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.39/1.20 # Starting new_bool_3 with 300s (1) cores
% 5.39/1.20 # Starting new_bool_1 with 300s (1) cores
% 5.39/1.20 # Starting sh5l with 300s (1) cores
% 5.39/1.20 # SinE strategy is gf500_gu_R04_F100_L20000
% 5.39/1.20 # Search class: FGHSM-FSLM32-MFFFFFNN
% 5.39/1.20 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 5.39/1.20 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 5.39/1.20 # Preprocessing time : 0.012 s
% 5.39/1.20
% 5.39/1.20 # Proof found!
% 5.39/1.20 # SZS status Theorem
% 5.39/1.20 # SZS output start CNFRefutation
% See solution above
% 5.39/1.20 # Parsed axioms : 283
% 5.39/1.20 # Removed by relevancy pruning/SinE : 24
% 5.39/1.20 # Initial clauses : 535
% 5.39/1.20 # Removed in clause preprocessing : 4
% 5.39/1.20 # Initial clauses in saturation : 531
% 5.39/1.20 # Processed clauses : 2846
% 5.39/1.20 # ...of these trivial : 36
% 5.39/1.20 # ...subsumed : 1295
% 5.39/1.20 # ...remaining for further processing : 1515
% 5.39/1.20 # Other redundant clauses eliminated : 97
% 5.39/1.20 # Clauses deleted for lack of memory : 0
% 5.39/1.20 # Backward-subsumed : 90
% 5.39/1.20 # Backward-rewritten : 92
% 5.39/1.20 # Generated clauses : 29097
% 5.39/1.20 # ...of the previous two non-redundant : 27476
% 5.39/1.20 # ...aggressively subsumed : 0
% 5.39/1.20 # Contextual simplify-reflections : 91
% 5.39/1.20 # Paramodulations : 28904
% 5.39/1.20 # Factorizations : 19
% 5.39/1.20 # NegExts : 0
% 5.39/1.20 # Equation resolutions : 171
% 5.39/1.20 # Disequality decompositions : 0
% 5.39/1.20 # Total rewrite steps : 4522
% 5.39/1.20 # ...of those cached : 4227
% 5.39/1.20 # Propositional unsat checks : 0
% 5.39/1.20 # Propositional check models : 0
% 5.39/1.20 # Propositional check unsatisfiable : 0
% 5.39/1.20 # Propositional clauses : 0
% 5.39/1.20 # Propositional clauses after purity: 0
% 5.39/1.20 # Propositional unsat core size : 0
% 5.39/1.20 # Propositional preprocessing time : 0.000
% 5.39/1.20 # Propositional encoding time : 0.000
% 5.39/1.20 # Propositional solver time : 0.000
% 5.39/1.20 # Success case prop preproc time : 0.000
% 5.39/1.20 # Success case prop encoding time : 0.000
% 5.39/1.20 # Success case prop solver time : 0.000
% 5.39/1.20 # Current number of processed clauses : 1323
% 5.39/1.20 # Positive orientable unit clauses : 102
% 5.39/1.20 # Positive unorientable unit clauses: 3
% 5.39/1.20 # Negative unit clauses : 117
% 5.39/1.20 # Non-unit-clauses : 1101
% 5.39/1.20 # Current number of unprocessed clauses: 24975
% 5.39/1.20 # ...number of literals in the above : 114440
% 5.39/1.20 # Current number of archived formulas : 0
% 5.39/1.20 # Current number of archived clauses : 185
% 5.39/1.20 # Clause-clause subsumption calls (NU) : 362554
% 5.39/1.20 # Rec. Clause-clause subsumption calls : 168981
% 5.39/1.20 # Non-unit clause-clause subsumptions : 868
% 5.39/1.20 # Unit Clause-clause subsumption calls : 34048
% 5.39/1.20 # Rewrite failures with RHS unbound : 0
% 5.39/1.20 # BW rewrite match attempts : 69
% 5.39/1.20 # BW rewrite match successes : 53
% 5.39/1.20 # Condensation attempts : 0
% 5.39/1.20 # Condensation successes : 0
% 5.39/1.20 # Termbank termtop insertions : 438848
% 5.39/1.20 # Search garbage collected termcells : 9107
% 5.39/1.20
% 5.39/1.20 # -------------------------------------------------
% 5.39/1.20 # User time : 0.646 s
% 5.39/1.20 # System time : 0.023 s
% 5.39/1.20 # Total time : 0.669 s
% 5.39/1.20 # Maximum resident set size: 3696 pages
% 5.39/1.20
% 5.39/1.20 # -------------------------------------------------
% 5.39/1.20 # User time : 0.652 s
% 5.39/1.20 # System time : 0.026 s
% 5.39/1.20 # Total time : 0.678 s
% 5.39/1.20 # Maximum resident set size: 1988 pages
% 5.39/1.20 % E---3.1 exiting
%------------------------------------------------------------------------------