TSTP Solution File: SEU189+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU189+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:48 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 58 ( 21 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 55 ( 23 ~; 15 |; 8 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn; 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fc6_relat_1,axiom,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_rng(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.4EmOeHxCDI/E---3.1_8966.p',fc6_relat_1) ).
fof(t65_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
file('/export/starexec/sandbox2/tmp/tmp.4EmOeHxCDI/E---3.1_8966.p',t65_relat_1) ).
fof(fc5_relat_1,axiom,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_dom(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.4EmOeHxCDI/E---3.1_8966.p',fc5_relat_1) ).
fof(fc4_relat_1,axiom,
( empty(empty_set)
& relation(empty_set) ),
file('/export/starexec/sandbox2/tmp/tmp.4EmOeHxCDI/E---3.1_8966.p',fc4_relat_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.4EmOeHxCDI/E---3.1_8966.p',t6_boole) ).
fof(t60_relat_1,axiom,
( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.4EmOeHxCDI/E---3.1_8966.p',t60_relat_1) ).
fof(c_0_6,plain,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_rng(X1)) ),
inference(fof_simplification,[status(thm)],[fc6_relat_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
inference(assume_negation,[status(cth)],[t65_relat_1]) ).
fof(c_0_8,plain,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_dom(X1)) ),
inference(fof_simplification,[status(thm)],[fc5_relat_1]) ).
fof(c_0_9,plain,
! [X6] :
( empty(X6)
| ~ relation(X6)
| ~ empty(relation_rng(X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_10,negated_conjecture,
( relation(esk1_0)
& ( relation_dom(esk1_0) != empty_set
| relation_rng(esk1_0) != empty_set )
& ( relation_dom(esk1_0) = empty_set
| relation_rng(esk1_0) = empty_set ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X8] :
( empty(X8)
| ~ relation(X8)
| ~ empty(relation_dom(X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_12,plain,
( empty(X1)
| ~ relation(X1)
| ~ empty(relation_rng(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( relation_dom(esk1_0) = empty_set
| relation_rng(esk1_0) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc4_relat_1]) ).
fof(c_0_16,plain,
! [X4] :
( ~ empty(X4)
| X4 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_17,plain,
( empty(X1)
| ~ relation(X1)
| ~ empty(relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( relation_dom(esk1_0) = empty_set
| empty(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_19,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
empty(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
( relation_dom(esk1_0) != empty_set
| relation_rng(esk1_0) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
esk1_0 = empty_set,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
relation_dom(empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[t60_relat_1]) ).
cnf(c_0_24,plain,
relation_rng(empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[t60_relat_1]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_22]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU189+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n014.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 09:22:35 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.4EmOeHxCDI/E---3.1_8966.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # new_bool_1 with pid 9045 completed with status 0
% 0.16/0.44 # Result found by new_bool_1
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGHSF-FFSM11-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 9049 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGHSF-FFSM11-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 25
% 0.16/0.44 # Removed by relevancy pruning/SinE : 9
% 0.16/0.44 # Initial clauses : 25
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 25
% 0.16/0.44 # Processed clauses : 51
% 0.16/0.44 # ...of these trivial : 1
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 50
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 8
% 0.16/0.44 # Generated clauses : 16
% 0.16/0.44 # ...of the previous two non-redundant : 8
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 16
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 36
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 18
% 0.16/0.44 # Positive orientable unit clauses : 8
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 2
% 0.16/0.44 # Non-unit-clauses : 8
% 0.16/0.44 # Current number of unprocessed clauses: 6
% 0.16/0.44 # ...number of literals in the above : 13
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 32
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 8
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 8
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 6
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 4
% 0.16/0.44 # BW rewrite match successes : 4
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 1159
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.005 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.006 s
% 0.16/0.44 # Maximum resident set size: 1772 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.006 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.008 s
% 0.16/0.44 # Maximum resident set size: 1688 pages
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------