TSTP Solution File: SEU444+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU444+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:32:14 EDT 2023
% Result : Theorem 6.14s 1.64s
% Output : CNFRefutation 6.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 25 ( 15 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 24 ( 10 ~; 6 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 18 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relset_2,conjecture,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cGsUFywAAN/E---3.1_26159.p',t56_relset_2) ).
fof(t51_relset_2,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k2_funct_5(X3) = k10_relset_1(X2,X1,X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cGsUFywAAN/E---3.1_26159.p',t51_relset_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3)) ) ),
inference(assume_negation,[status(cth)],[t56_relset_2]) ).
fof(c_0_3,negated_conjecture,
( m2_relset_1(esk3_0,esk2_0,esk1_0)
& ( k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0)
| k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X100,X101,X102] :
( ( k1_funct_5(X102) = k10_relset_1(X100,X101,k6_relset_1(X101,X100,X102),X100)
| ~ m2_relset_1(X102,X101,X100) )
& ( k2_funct_5(X102) = k10_relset_1(X101,X100,X102,X101)
| ~ m2_relset_1(X102,X101,X100) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t51_relset_2])])]) ).
cnf(c_0_5,negated_conjecture,
( k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0)
| k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( k2_funct_5(X1) = k10_relset_1(X2,X3,X1,X2)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
m2_relset_1(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) != k1_funct_5(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_9,plain,
( k1_funct_5(X1) = k10_relset_1(X2,X3,k6_relset_1(X3,X2,X1),X2)
| ~ m2_relset_1(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU444+2 : TPTP v8.1.2. Released v3.4.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n020.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 08:57:31 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.57/0.76 Running first-order model finding
% 0.57/0.76 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.cGsUFywAAN/E---3.1_26159.p
% 6.14/1.64 # Version: 3.1pre001
% 6.14/1.64 # Preprocessing class: FMLMSMLLSSSNFFN.
% 6.14/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.14/1.64 # Starting new_bool_3 with 900s (3) cores
% 6.14/1.64 # Starting new_bool_1 with 900s (3) cores
% 6.14/1.64 # Starting sh5l with 300s (1) cores
% 6.14/1.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 6.14/1.64 # G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 26239 completed with status 0
% 6.14/1.64 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 6.14/1.64 # Preprocessing class: FMLMSMLLSSSNFFN.
% 6.14/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.14/1.64 # Starting new_bool_3 with 900s (3) cores
% 6.14/1.64 # Starting new_bool_1 with 900s (3) cores
% 6.14/1.64 # Starting sh5l with 300s (1) cores
% 6.14/1.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 6.14/1.64 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 6.14/1.64 # Search class: FGHSM-FSLM32-DFFFFFNN
% 6.14/1.64 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 6.14/1.64 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 6.14/1.64 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 26240 completed with status 0
% 6.14/1.64 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 6.14/1.64 # Preprocessing class: FMLMSMLLSSSNFFN.
% 6.14/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.14/1.64 # Starting new_bool_3 with 900s (3) cores
% 6.14/1.64 # Starting new_bool_1 with 900s (3) cores
% 6.14/1.64 # Starting sh5l with 300s (1) cores
% 6.14/1.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 6.14/1.64 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 6.14/1.64 # Search class: FGHSM-FSLM32-DFFFFFNN
% 6.14/1.64 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 6.14/1.64 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 6.14/1.64 # Preprocessing time : 0.030 s
% 6.14/1.64
% 6.14/1.64 # Proof found!
% 6.14/1.64 # SZS status Theorem
% 6.14/1.64 # SZS output start CNFRefutation
% See solution above
% 6.14/1.64 # Parsed axioms : 4528
% 6.14/1.64 # Removed by relevancy pruning/SinE : 4027
% 6.14/1.64 # Initial clauses : 860
% 6.14/1.64 # Removed in clause preprocessing : 31
% 6.14/1.64 # Initial clauses in saturation : 829
% 6.14/1.64 # Processed clauses : 860
% 6.14/1.64 # ...of these trivial : 19
% 6.14/1.64 # ...subsumed : 45
% 6.14/1.64 # ...remaining for further processing : 796
% 6.14/1.64 # Other redundant clauses eliminated : 88
% 6.14/1.64 # Clauses deleted for lack of memory : 0
% 6.14/1.64 # Backward-subsumed : 1
% 6.14/1.64 # Backward-rewritten : 16
% 6.14/1.64 # Generated clauses : 21087
% 6.14/1.64 # ...of the previous two non-redundant : 19623
% 6.14/1.64 # ...aggressively subsumed : 0
% 6.14/1.64 # Contextual simplify-reflections : 11
% 6.14/1.64 # Paramodulations : 20931
% 6.14/1.64 # Factorizations : 34
% 6.14/1.64 # NegExts : 0
% 6.14/1.64 # Equation resolutions : 123
% 6.14/1.64 # Total rewrite steps : 17211
% 6.14/1.64 # Propositional unsat checks : 0
% 6.14/1.64 # Propositional check models : 0
% 6.14/1.64 # Propositional check unsatisfiable : 0
% 6.14/1.64 # Propositional clauses : 0
% 6.14/1.64 # Propositional clauses after purity: 0
% 6.14/1.64 # Propositional unsat core size : 0
% 6.14/1.64 # Propositional preprocessing time : 0.000
% 6.14/1.64 # Propositional encoding time : 0.000
% 6.14/1.64 # Propositional solver time : 0.000
% 6.14/1.64 # Success case prop preproc time : 0.000
% 6.14/1.64 # Success case prop encoding time : 0.000
% 6.14/1.64 # Success case prop solver time : 0.000
% 6.14/1.64 # Current number of processed clauses : 767
% 6.14/1.64 # Positive orientable unit clauses : 106
% 6.14/1.64 # Positive unorientable unit clauses: 8
% 6.14/1.64 # Negative unit clauses : 15
% 6.14/1.64 # Non-unit-clauses : 638
% 6.14/1.64 # Current number of unprocessed clauses: 19584
% 6.14/1.64 # ...number of literals in the above : 70647
% 6.14/1.64 # Current number of archived formulas : 0
% 6.14/1.64 # Current number of archived clauses : 20
% 6.14/1.64 # Clause-clause subsumption calls (NU) : 93176
% 6.14/1.64 # Rec. Clause-clause subsumption calls : 34277
% 6.14/1.64 # Non-unit clause-clause subsumptions : 52
% 6.14/1.64 # Unit Clause-clause subsumption calls : 3175
% 6.14/1.64 # Rewrite failures with RHS unbound : 0
% 6.14/1.64 # BW rewrite match attempts : 247
% 6.14/1.64 # BW rewrite match successes : 66
% 6.14/1.64 # Condensation attempts : 0
% 6.14/1.64 # Condensation successes : 0
% 6.14/1.64 # Termbank termtop insertions : 559788
% 6.14/1.64
% 6.14/1.64 # -------------------------------------------------
% 6.14/1.64 # User time : 0.694 s
% 6.14/1.64 # System time : 0.039 s
% 6.14/1.64 # Total time : 0.733 s
% 6.14/1.64 # Maximum resident set size: 9896 pages
% 6.14/1.64
% 6.14/1.64 # -------------------------------------------------
% 6.14/1.64 # User time : 0.816 s
% 6.14/1.64 # System time : 0.045 s
% 6.14/1.64 # Total time : 0.860 s
% 6.14/1.64 # Maximum resident set size: 7220 pages
% 6.14/1.64 % E---3.1 exiting
%------------------------------------------------------------------------------