TSTP Solution File: SEU413+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU413+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:26:23 EDT 2023
% Result : Theorem 0.23s 0.56s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 109 ( 37 ~; 33 |; 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 : 37 ( 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/tmp/tmp.oJOx4NZRUs/E---3.1_8105.p',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/sandbox/tmp/tmp.oJOx4NZRUs/E---3.1_8105.p',t21_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/tmp/tmp.oJOx4NZRUs/E---3.1_8105.p',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/sandbox/tmp/tmp.oJOx4NZRUs/E---3.1_8105.p',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,
! [X52,X53,X54,X55] :
( ~ l1_orders_2(X52)
| ~ l1_orders_2(X53)
| ~ v12_waybel_0(k3_xboole_0(u1_struct_0(X52),u1_struct_0(X53)),X53)
| ~ m1_subset_1(k3_xboole_0(u1_struct_0(X52),u1_struct_0(X53)),k1_zfmisc_1(u1_struct_0(X53)))
| ~ r2_hidden(k4_tarski(X54,X55),u1_orders_2(k1_latsum_1(X52,X53)))
| ~ r2_hidden(X55,u1_struct_0(X52))
| r2_hidden(X54,u1_struct_0(X52)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_latsum_1])])]) ).
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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X17,X18,X19] :
( ( ~ r1_orders_2(X17,X18,X19)
| r2_hidden(k4_tarski(X18,X19),u1_orders_2(X17))
| ~ m1_subset_1(X19,u1_struct_0(X17))
| ~ m1_subset_1(X18,u1_struct_0(X17))
| ~ l1_orders_2(X17) )
& ( ~ r2_hidden(k4_tarski(X18,X19),u1_orders_2(X17))
| r1_orders_2(X17,X18,X19)
| ~ m1_subset_1(X19,u1_struct_0(X17))
| ~ m1_subset_1(X18,u1_struct_0(X17))
| ~ l1_orders_2(X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_orders_2])])])]) ).
cnf(c_0_8,plain,
( r2_hidden(X3,u1_struct_0(X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(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)))
| ~ r2_hidden(k4_tarski(X3,X4),u1_orders_2(k1_latsum_1(X1,X2)))
| ~ r2_hidden(X4,u1_struct_0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,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_10,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_11,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( r2_hidden(k4_tarski(X2,X3),u1_orders_2(X1))
| ~ r1_orders_2(X1,X2,X3)
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l1_orders_2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,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_15,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_16,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_17,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_8,c_0_9]),c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_18,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_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
r2_hidden(esk4_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_21,plain,
! [X22,X23] :
( ( v1_orders_2(k1_latsum_1(X22,X23))
| ~ l1_orders_2(X22)
| ~ l1_orders_2(X23) )
& ( l1_orders_2(k1_latsum_1(X22,X23))
| ~ l1_orders_2(X22)
| ~ l1_orders_2(X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])]) ).
cnf(c_0_22,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_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_23,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU413+1 : TPTP v8.1.2. Released v3.4.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n004.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 08:52:45 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.oJOx4NZRUs/E---3.1_8105.p
% 0.23/0.56 # Version: 3.1pre001
% 0.23/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.56 # Starting sh5l with 300s (1) cores
% 0.23/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8200 completed with status 0
% 0.23/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 # No SInE strategy applied
% 0.23/0.56 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.23/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.23/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/0.56 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.23/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.23/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 8214 completed with status 0
% 0.23/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.23/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 # No SInE strategy applied
% 0.23/0.56 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.23/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.23/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/0.56 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.23/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.23/0.56 # Preprocessing time : 0.001 s
% 0.23/0.56 # Presaturation interreduction done
% 0.23/0.56
% 0.23/0.56 # Proof found!
% 0.23/0.56 # SZS status Theorem
% 0.23/0.56 # SZS output start CNFRefutation
% See solution above
% 0.23/0.56 # Parsed axioms : 42
% 0.23/0.56 # Removed by relevancy pruning/SinE : 0
% 0.23/0.56 # Initial clauses : 56
% 0.23/0.56 # Removed in clause preprocessing : 9
% 0.23/0.56 # Initial clauses in saturation : 47
% 0.23/0.56 # Processed clauses : 382
% 0.23/0.56 # ...of these trivial : 1
% 0.23/0.56 # ...subsumed : 109
% 0.23/0.56 # ...remaining for further processing : 272
% 0.23/0.56 # Other redundant clauses eliminated : 0
% 0.23/0.56 # Clauses deleted for lack of memory : 0
% 0.23/0.56 # Backward-subsumed : 10
% 0.23/0.56 # Backward-rewritten : 3
% 0.23/0.56 # Generated clauses : 566
% 0.23/0.56 # ...of the previous two non-redundant : 493
% 0.23/0.56 # ...aggressively subsumed : 0
% 0.23/0.56 # Contextual simplify-reflections : 2
% 0.23/0.56 # Paramodulations : 564
% 0.23/0.56 # Factorizations : 0
% 0.23/0.56 # NegExts : 0
% 0.23/0.56 # Equation resolutions : 2
% 0.23/0.56 # Total rewrite steps : 99
% 0.23/0.56 # Propositional unsat checks : 0
% 0.23/0.56 # Propositional check models : 0
% 0.23/0.56 # Propositional check unsatisfiable : 0
% 0.23/0.56 # Propositional clauses : 0
% 0.23/0.56 # Propositional clauses after purity: 0
% 0.23/0.56 # Propositional unsat core size : 0
% 0.23/0.56 # Propositional preprocessing time : 0.000
% 0.23/0.56 # Propositional encoding time : 0.000
% 0.23/0.56 # Propositional solver time : 0.000
% 0.23/0.56 # Success case prop preproc time : 0.000
% 0.23/0.56 # Success case prop encoding time : 0.000
% 0.23/0.56 # Success case prop solver time : 0.000
% 0.23/0.56 # Current number of processed clauses : 212
% 0.23/0.56 # Positive orientable unit clauses : 33
% 0.23/0.56 # Positive unorientable unit clauses: 1
% 0.23/0.56 # Negative unit clauses : 10
% 0.23/0.56 # Non-unit-clauses : 168
% 0.23/0.56 # Current number of unprocessed clauses: 201
% 0.23/0.56 # ...number of literals in the above : 525
% 0.23/0.56 # Current number of archived formulas : 0
% 0.23/0.56 # Current number of archived clauses : 60
% 0.23/0.56 # Clause-clause subsumption calls (NU) : 5983
% 0.23/0.56 # Rec. Clause-clause subsumption calls : 4156
% 0.23/0.56 # Non-unit clause-clause subsumptions : 111
% 0.23/0.56 # Unit Clause-clause subsumption calls : 189
% 0.23/0.56 # Rewrite failures with RHS unbound : 0
% 0.23/0.56 # BW rewrite match attempts : 27
% 0.23/0.56 # BW rewrite match successes : 14
% 0.23/0.56 # Condensation attempts : 0
% 0.23/0.56 # Condensation successes : 0
% 0.23/0.56 # Termbank termtop insertions : 11662
% 0.23/0.56
% 0.23/0.56 # -------------------------------------------------
% 0.23/0.56 # User time : 0.025 s
% 0.23/0.56 # System time : 0.002 s
% 0.23/0.56 # Total time : 0.027 s
% 0.23/0.56 # Maximum resident set size: 1860 pages
% 0.23/0.56
% 0.23/0.56 # -------------------------------------------------
% 0.23/0.56 # User time : 0.085 s
% 0.23/0.56 # System time : 0.016 s
% 0.23/0.56 # Total time : 0.101 s
% 0.23/0.56 # Maximum resident set size: 1732 pages
% 0.23/0.56 % E---3.1 exiting
% 0.23/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------