TSTP Solution File: SEU041+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU041+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:16 EDT 2023
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 44 ( 18 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 43 ( 16 ~; 12 |; 7 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t82_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( subset(X1,X2)
=> ( relation_dom_restriction(relation_dom_restriction(X3,X1),X2) = relation_dom_restriction(X3,X1)
& relation_dom_restriction(relation_dom_restriction(X3,X2),X1) = relation_dom_restriction(X3,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nWC1vqGy9q/E---3.1_4923.p',t82_funct_1) ).
fof(t103_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_dom_restriction(relation_dom_restriction(X3,X2),X1) = relation_dom_restriction(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nWC1vqGy9q/E---3.1_4923.p',t103_relat_1) ).
fof(t102_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_dom_restriction(relation_dom_restriction(X3,X1),X2) = relation_dom_restriction(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nWC1vqGy9q/E---3.1_4923.p',t102_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( subset(X1,X2)
=> ( relation_dom_restriction(relation_dom_restriction(X3,X1),X2) = relation_dom_restriction(X3,X1)
& relation_dom_restriction(relation_dom_restriction(X3,X2),X1) = relation_dom_restriction(X3,X1) ) ) ),
inference(assume_negation,[status(cth)],[t82_funct_1]) ).
fof(c_0_4,plain,
! [X14,X15,X16] :
( ~ relation(X16)
| ~ subset(X14,X15)
| relation_dom_restriction(relation_dom_restriction(X16,X15),X14) = relation_dom_restriction(X16,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t103_relat_1])]) ).
fof(c_0_5,negated_conjecture,
( relation(esk3_0)
& function(esk3_0)
& subset(esk1_0,esk2_0)
& ( relation_dom_restriction(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != relation_dom_restriction(esk3_0,esk1_0)
| relation_dom_restriction(relation_dom_restriction(esk3_0,esk2_0),esk1_0) != relation_dom_restriction(esk3_0,esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( relation_dom_restriction(relation_dom_restriction(X1,X3),X2) = relation_dom_restriction(X1,X2)
| ~ relation(X1)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X11,X12,X13] :
( ~ relation(X13)
| ~ subset(X11,X12)
| relation_dom_restriction(relation_dom_restriction(X13,X11),X12) = relation_dom_restriction(X13,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t102_relat_1])]) ).
cnf(c_0_9,negated_conjecture,
( relation_dom_restriction(relation_dom_restriction(X1,esk2_0),esk1_0) = relation_dom_restriction(X1,esk1_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( relation_dom_restriction(relation_dom_restriction(X1,X2),X3) = relation_dom_restriction(X1,X2)
| ~ relation(X1)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( relation_dom_restriction(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != relation_dom_restriction(esk3_0,esk1_0)
| relation_dom_restriction(relation_dom_restriction(esk3_0,esk2_0),esk1_0) != relation_dom_restriction(esk3_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
relation_dom_restriction(relation_dom_restriction(esk3_0,esk2_0),esk1_0) = relation_dom_restriction(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( relation_dom_restriction(relation_dom_restriction(X1,esk1_0),esk2_0) = relation_dom_restriction(X1,esk1_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
relation_dom_restriction(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != relation_dom_restriction(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU041+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:43:21 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.nWC1vqGy9q/E---3.1_4923.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_1 with pid 5003 completed with status 0
% 0.17/0.45 # Result found by new_bool_1
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.17/0.45 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 5006 completed with status 0
% 0.17/0.45 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 34
% 0.17/0.45 # Removed by relevancy pruning/SinE : 8
% 0.17/0.45 # Initial clauses : 38
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 38
% 0.17/0.45 # Processed clauses : 78
% 0.17/0.45 # ...of these trivial : 1
% 0.17/0.45 # ...subsumed : 6
% 0.17/0.45 # ...remaining for further processing : 71
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 16
% 0.17/0.45 # Generated clauses : 87
% 0.17/0.45 # ...of the previous two non-redundant : 82
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 87
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 40
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 55
% 0.17/0.45 # Positive orientable unit clauses : 26
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 5
% 0.17/0.45 # Non-unit-clauses : 24
% 0.17/0.45 # Current number of unprocessed clauses: 35
% 0.17/0.45 # ...number of literals in the above : 44
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 16
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 50
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 46
% 0.17/0.45 # Non-unit clause-clause subsumptions : 3
% 0.17/0.45 # Unit Clause-clause subsumption calls : 80
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 5
% 0.17/0.45 # BW rewrite match successes : 4
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 2589
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.006 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.008 s
% 0.17/0.45 # Maximum resident set size: 1852 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.009 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.011 s
% 0.17/0.45 # Maximum resident set size: 1696 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------