TSTP Solution File: SEU247+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU247+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:25:51 EDT 2024
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 22 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 4 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t18_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> relation_restriction(X2,X1) = relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.4NiGmps8DG/E---3.1_4146.p',t18_wellord1) ).
fof(t140_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> relation_dom_restriction(relation_rng_restriction(X1,X3),X2) = relation_rng_restriction(X1,relation_dom_restriction(X3,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.4NiGmps8DG/E---3.1_4146.p',t140_relat_1) ).
fof(t17_wellord1,axiom,
! [X1,X2] :
( relation(X2)
=> relation_restriction(X2,X1) = relation_dom_restriction(relation_rng_restriction(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.4NiGmps8DG/E---3.1_4146.p',t17_wellord1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> relation_restriction(X2,X1) = relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) ),
inference(assume_negation,[status(cth)],[t18_wellord1]) ).
fof(c_0_4,negated_conjecture,
( relation(esk2_0)
& relation_restriction(esk2_0,esk1_0) != relation_rng_restriction(esk1_0,relation_dom_restriction(esk2_0,esk1_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_5,plain,
! [X8,X9,X10] :
( ~ relation(X10)
| relation_dom_restriction(relation_rng_restriction(X8,X10),X9) = relation_rng_restriction(X8,relation_dom_restriction(X10,X9)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t140_relat_1])])]) ).
cnf(c_0_6,negated_conjecture,
relation_restriction(esk2_0,esk1_0) != relation_rng_restriction(esk1_0,relation_dom_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( relation_dom_restriction(relation_rng_restriction(X2,X1),X3) = relation_rng_restriction(X2,relation_dom_restriction(X1,X3))
| ~ 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_4]) ).
fof(c_0_9,plain,
! [X11,X12] :
( ~ relation(X12)
| relation_restriction(X12,X11) = relation_dom_restriction(relation_rng_restriction(X11,X12),X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t17_wellord1])])]) ).
cnf(c_0_10,negated_conjecture,
relation_dom_restriction(relation_rng_restriction(esk1_0,esk2_0),esk1_0) != relation_restriction(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,plain,
( relation_restriction(X1,X2) = relation_dom_restriction(relation_rng_restriction(X2,X1),X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SEU247+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n004.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 : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 07:46:33 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.4NiGmps8DG/E---3.1_4146.p
% 0.15/0.42 # Version: 3.1.0
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 4225 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUSF-FFSF22-SFFFFFNN
% 0.15/0.42 # partial match(1): FHUSM-FFSF22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.15/0.42 # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 4229 completed with status 0
% 0.15/0.42 # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUSF-FFSF22-SFFFFFNN
% 0.15/0.42 # partial match(1): FHUSM-FFSF22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 11
% 0.15/0.42 # Removed by relevancy pruning/SinE : 5
% 0.15/0.42 # Initial clauses : 7
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 7
% 0.15/0.42 # Processed clauses : 16
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 1
% 0.15/0.42 # ...remaining for further processing : 15
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 0
% 0.15/0.42 # Generated clauses : 6
% 0.15/0.42 # ...of the previous two non-redundant : 5
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 6
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Disequality decompositions : 0
% 0.15/0.42 # Total rewrite steps : 2
% 0.15/0.42 # ...of those cached : 1
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 8
% 0.15/0.42 # Positive orientable unit clauses : 1
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 2
% 0.15/0.42 # Non-unit-clauses : 5
% 0.15/0.42 # Current number of unprocessed clauses: 3
% 0.15/0.42 # ...number of literals in the above : 9
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 7
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 1
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 1
% 0.15/0.42 # Non-unit clause-clause subsumptions : 1
% 0.15/0.42 # Unit Clause-clause subsumption calls : 1
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 0
% 0.15/0.42 # BW rewrite match successes : 0
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 555
% 0.15/0.42 # Search garbage collected termcells : 99
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.003 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.004 s
% 0.15/0.42 # Maximum resident set size: 1724 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.002 s
% 0.15/0.42 # Total time : 0.007 s
% 0.15/0.42 # Maximum resident set size: 1696 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------