TSTP Solution File: SEU413+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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 : 600s
% DateTime : Tue Jul 19 09:19:50 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 105 ( 35 ~; 31 |; 21 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_latsum_1,conjecture,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( ( v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
& r1_orders_2(k1_latsum_1(X1,X2),X3,X4)
& r2_hidden(X4,u1_struct_0(X1)) )
=> r2_hidden(X3,u1_struct_0(X1)) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t23_latsum_1) ).
fof(d9_orders_2,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r1_orders_2(X1,X2,X3)
<=> r2_hidden(k4_tarski(X2,X3),u1_orders_2(X1)) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d9_orders_2) ).
fof(t21_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3,X4] :
( ( v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
& r2_hidden(k4_tarski(X3,X4),u1_orders_2(k1_latsum_1(X1,X2)))
& r2_hidden(X4,u1_struct_0(X1)) )
=> r2_hidden(X3,u1_struct_0(X1)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t21_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X1)
& l1_orders_2(X2) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& l1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_latsum_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( ( v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
& m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
& r1_orders_2(k1_latsum_1(X1,X2),X3,X4)
& r2_hidden(X4,u1_struct_0(X1)) )
=> r2_hidden(X3,u1_struct_0(X1)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t23_latsum_1]) ).
fof(c_0_5,plain,
! [X4,X5,X6] :
( ( ~ r1_orders_2(X4,X5,X6)
| r2_hidden(k4_tarski(X5,X6),u1_orders_2(X4))
| ~ m1_subset_1(X6,u1_struct_0(X4))
| ~ m1_subset_1(X5,u1_struct_0(X4))
| ~ l1_orders_2(X4) )
& ( ~ r2_hidden(k4_tarski(X5,X6),u1_orders_2(X4))
| r1_orders_2(X4,X5,X6)
| ~ m1_subset_1(X6,u1_struct_0(X4))
| ~ m1_subset_1(X5,u1_struct_0(X4))
| ~ l1_orders_2(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_orders_2])])])])])]) ).
fof(c_0_6,negated_conjecture,
( l1_orders_2(esk1_0)
& l1_orders_2(esk2_0)
& m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0)
& m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0)))
& r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_0)
& r2_hidden(esk4_0,u1_struct_0(esk1_0))
& ~ r2_hidden(esk3_0,u1_struct_0(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_7,plain,
! [X5,X6,X7,X8] :
( ~ l1_orders_2(X5)
| ~ l1_orders_2(X6)
| ~ v12_waybel_0(k3_xboole_0(u1_struct_0(X5),u1_struct_0(X6)),X6)
| ~ m1_subset_1(k3_xboole_0(u1_struct_0(X5),u1_struct_0(X6)),k1_zfmisc_1(u1_struct_0(X6)))
| ~ r2_hidden(k4_tarski(X7,X8),u1_orders_2(k1_latsum_1(X5,X6)))
| ~ r2_hidden(X8,u1_struct_0(X5))
| r2_hidden(X7,u1_struct_0(X5)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_latsum_1])])])])]) ).
cnf(c_0_8,plain,
( r2_hidden(k4_tarski(X2,X3),u1_orders_2(X1))
| ~ l1_orders_2(X1)
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ r1_orders_2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( r2_hidden(X1,u1_struct_0(X2))
| ~ r2_hidden(X3,u1_struct_0(X2))
| ~ r2_hidden(k4_tarski(X1,X3),u1_orders_2(k1_latsum_1(X2,X4)))
| ~ m1_subset_1(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X4)),k1_zfmisc_1(u1_struct_0(X4)))
| ~ v12_waybel_0(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X4)),X4)
| ~ l1_orders_2(X4)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( r2_hidden(k4_tarski(esk3_0,esk4_0),u1_orders_2(k1_latsum_1(esk1_0,esk2_0)))
| ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
r2_hidden(esk4_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ( v1_orders_2(k1_latsum_1(X3,X4))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X4) )
& ( l1_orders_2(k1_latsum_1(X3,X4))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])]) ).
cnf(c_0_21,negated_conjecture,
~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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]),c_0_16]),c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_22,plain,
( l1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% 0.09/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 21:04:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.017 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 24
% 0.22/1.40 # Proof object clause steps : 15
% 0.22/1.40 # Proof object formula steps : 9
% 0.22/1.40 # Proof object conjectures : 15
% 0.22/1.40 # Proof object clause conjectures : 12
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 12
% 0.22/1.40 # Proof object initial formulas used : 4
% 0.22/1.40 # Proof object generating inferences : 3
% 0.22/1.40 # Proof object simplifying inferences : 13
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 42
% 0.22/1.40 # Removed by relevancy pruning/SinE : 18
% 0.22/1.40 # Initial clauses : 37
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 37
% 0.22/1.40 # Processed clauses : 63
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 3
% 0.22/1.40 # ...remaining for further processing : 60
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 56
% 0.22/1.40 # ...of the previous two non-trivial : 45
% 0.22/1.40 # Contextual simplify-reflections : 1
% 0.22/1.40 # Paramodulations : 56
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 60
% 0.22/1.40 # Positive orientable unit clauses : 18
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 5
% 0.22/1.40 # Non-unit-clauses : 36
% 0.22/1.40 # Current number of unprocessed clauses: 19
% 0.22/1.40 # ...number of literals in the above : 46
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 232
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 116
% 0.22/1.40 # Non-unit clause-clause subsumptions : 4
% 0.22/1.40 # Unit Clause-clause subsumption calls : 37
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 4
% 0.22/1.40 # BW rewrite match successes : 4
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 2956
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.020 s
% 0.22/1.40 # System time : 0.000 s
% 0.22/1.40 # Total time : 0.020 s
% 0.22/1.40 # Maximum resident set size: 3036 pages
%------------------------------------------------------------------------------