%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU413+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:51 EDT 2022
% Result : Theorem 4.03s 30.21s
% Output : CNFRefutation 4.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 16 unt; 0 def)
% Number of atoms : 109 ( 3 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 121 ( 43 ~; 39 |; 21 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 30 !; 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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t23_latsum_1) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t21_latsum_1) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_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/sandbox2/benchmark/Axioms/SET007/SET007+218.ax',d9_orders_2) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_latsum_1) ).
fof(c_0_5,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_6,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])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] : k4_xboole_0(X3,k4_xboole_0(X3,X4)) = k3_xboole_0(X3,X4),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_8,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_5])])])])]) ).
cnf(c_0_9,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_6]) ).
cnf(c_0_10,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,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_8]) ).
cnf(c_0_12,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_8]) ).
fof(c_0_13,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])])])])])]) ).
cnf(c_0_14,plain,
( r2_hidden(X1,u1_struct_0(X2))
| ~ l1_orders_2(X4)
| ~ l1_orders_2(X2)
| ~ r2_hidden(X3,u1_struct_0(X2))
| ~ r2_hidden(k4_tarski(X1,X3),u1_orders_2(k1_latsum_1(X2,X4)))
| ~ v12_waybel_0(k4_xboole_0(u1_struct_0(X2),k4_xboole_0(u1_struct_0(X2),u1_struct_0(X4))),X4)
| ~ m1_subset_1(k4_xboole_0(u1_struct_0(X2),k4_xboole_0(u1_struct_0(X2),u1_struct_0(X4))),k1_zfmisc_1(u1_struct_0(X4))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
v12_waybel_0(k4_xboole_0(u1_struct_0(esk1_0),k4_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),esk2_0),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
m1_subset_1(k4_xboole_0(u1_struct_0(esk1_0),k4_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),k1_zfmisc_1(u1_struct_0(esk2_0))),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_19,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_13]) ).
cnf(c_0_20,negated_conjecture,
r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( r2_hidden(X1,u1_struct_0(esk1_0))
| ~ r2_hidden(k4_tarski(X1,X2),u1_orders_2(k1_latsum_1(esk1_0,esk2_0)))
| ~ r2_hidden(X2,u1_struct_0(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_24,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_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
r2_hidden(esk4_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_27,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_28,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(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_29,plain,
( l1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_17]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU413+4 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 19:36:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 4.01/27.07 eprover: CPU time limit exceeded, terminating
% 4.01/27.07 eprover: CPU time limit exceeded, terminating
% 4.01/27.07 eprover: CPU time limit exceeded, terminating
% 4.01/27.10 eprover: CPU time limit exceeded, terminating
% 4.03/30.21 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 4.03/30.21
% 4.03/30.21 # Failure: Resource limit exceeded (time)
% 4.03/30.21 # OLD status Res
% 4.03/30.21 # Preprocessing time : 20.877 s
% 4.03/30.21 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 4.03/30.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 4.03/30.21 # Preprocessing time : 2.697 s
% 4.03/30.21
% 4.03/30.21 # Proof found!
% 4.03/30.21 # SZS status Theorem
% 4.03/30.21 # SZS output start CNFRefutation
% See solution above
% 4.03/30.21 # Proof object total steps : 31
% 4.03/30.21 # Proof object clause steps : 20
% 4.03/30.21 # Proof object formula steps : 11
% 4.03/30.21 # Proof object conjectures : 18
% 4.03/30.21 # Proof object clause conjectures : 15
% 4.03/30.21 # Proof object formula conjectures : 3
% 4.03/30.21 # Proof object initial clauses used : 13
% 4.03/30.21 # Proof object initial formulas used : 5
% 4.03/30.21 # Proof object generating inferences : 4
% 4.03/30.21 # Proof object simplifying inferences : 17
% 4.03/30.21 # Training examples: 0 positive, 0 negative
% 4.03/30.21 # Parsed axioms : 66059
% 4.03/30.21 # Removed by relevancy pruning/SinE : 65958
% 4.03/30.21 # Initial clauses : 216
% 4.03/30.21 # Removed in clause preprocessing : 3
% 4.03/30.21 # Initial clauses in saturation : 213
% 4.03/30.21 # Processed clauses : 897
% 4.03/30.21 # ...of these trivial : 10
% 4.03/30.21 # ...subsumed : 269
% 4.03/30.21 # ...remaining for further processing : 618
% 4.03/30.21 # Other redundant clauses eliminated : 19
% 4.03/30.21 # Clauses deleted for lack of memory : 0
% 4.03/30.21 # Backward-subsumed : 37
% 4.03/30.21 # Backward-rewritten : 37
% 4.03/30.21 # Generated clauses : 5188
% 4.03/30.21 # ...of the previous two non-trivial : 4828
% 4.03/30.21 # Contextual simplify-reflections : 256
% 4.03/30.21 # Paramodulations : 5113
% 4.03/30.21 # Factorizations : 6
% 4.03/30.21 # Equation resolutions : 28
% 4.03/30.21 # Current number of processed clauses : 542
% 4.03/30.21 # Positive orientable unit clauses : 80
% 4.03/30.21 # Positive unorientable unit clauses: 3
% 4.03/30.21 # Negative unit clauses : 44
% 4.03/30.21 # Non-unit-clauses : 415
% 4.03/30.21 # Current number of unprocessed clauses: 3465
% 4.03/30.21 # ...number of literals in the above : 11660
% 4.03/30.21 # Current number of archived formulas : 0
% 4.03/30.21 # Current number of archived clauses : 75
% 4.03/30.21 # Clause-clause subsumption calls (NU) : 39813
% 4.03/30.21 # Rec. Clause-clause subsumption calls : 16897
% 4.03/30.21 # Non-unit clause-clause subsumptions : 520
% 4.03/30.21 # Unit Clause-clause subsumption calls : 3591
% 4.03/30.21 # Rewrite failures with RHS unbound : 0
% 4.03/30.21 # BW rewrite match attempts : 129
% 4.03/30.21 # BW rewrite match successes : 39
% 4.03/30.21 # Condensation attempts : 0
% 4.03/30.21 # Condensation successes : 0
% 4.03/30.21 # Termbank termtop insertions : 2487718
% 4.03/30.21
% 4.03/30.21 # -------------------------------------------------
% 4.03/30.21 # User time : 2.738 s
% 4.03/30.21 # System time : 0.129 s
% 4.03/30.21 # Total time : 2.867 s
% 4.03/30.21 # Maximum resident set size: 165268 pages
%------------------------------------------------------------------------------