TSTP Solution File: LAT286+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT286+4 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : 300s
% DateTime : Sat May 4 08:14:47 EDT 2024
% Result : Theorem 37.14s 21.27s
% Output : CNFRefutation 37.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 111 ( 4 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 127 ( 50 ~; 37 |; 26 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 35 ( 1 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.UDRNpBm3Z2/E---3.1_27952.p',t15_lopclset) ).
fof(t13_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
file('/export/starexec/sandbox/tmp/tmp.UDRNpBm3Z2/E---3.1_27952.p',t13_lopclset) ).
fof(redefinition_m2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.UDRNpBm3Z2/E---3.1_27952.p',redefinition_m2_subset_1) ).
fof(t8_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.UDRNpBm3Z2/E---3.1_27952.p',t8_lopclset) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox/tmp/tmp.UDRNpBm3Z2/E---3.1_27952.p',fc1_subset_1) ).
fof(dt_k1_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
file('/export/starexec/sandbox/tmp/tmp.UDRNpBm3Z2/E---3.1_27952.p',dt_k1_lopclset) ).
fof(fc1_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ~ v1_xboole_0(k1_lopclset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.UDRNpBm3Z2/E---3.1_27952.p',fc1_lopclset) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t15_lopclset])]) ).
fof(c_0_8,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
inference(fof_simplification,[status(thm)],[t13_lopclset]) ).
fof(c_0_9,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[redefinition_m2_subset_1]) ).
fof(c_0_10,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[t8_lopclset]) ).
fof(c_0_11,plain,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_12,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
inference(fof_simplification,[status(thm)],[dt_k1_lopclset]) ).
fof(c_0_13,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ~ v1_xboole_0(k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_lopclset]) ).
fof(c_0_14,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_15,plain,
! [X63] :
( v3_struct_0(X63)
| ~ v2_pre_topc(X63)
| ~ l1_pre_topc(X63)
| u1_struct_0(k6_lopclset(X63)) = k1_lopclset(X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_16,plain,
! [X807,X808,X809] :
( ( ~ m2_subset_1(X809,X807,X808)
| m1_subset_1(X809,X808)
| v1_xboole_0(X807)
| v1_xboole_0(X808)
| ~ m1_subset_1(X808,k1_zfmisc_1(X807)) )
& ( ~ m1_subset_1(X809,X808)
| m2_subset_1(X809,X807,X808)
| v1_xboole_0(X807)
| v1_xboole_0(X808)
| ~ m1_subset_1(X808,k1_zfmisc_1(X807)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_17,plain,
! [X162] :
( v3_struct_0(X162)
| ~ v2_pre_topc(X162)
| ~ l1_pre_topc(X162)
| m2_subset_1(k2_pre_topc(X162),k1_zfmisc_1(u1_struct_0(X162)),k1_lopclset(X162)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_18,plain,
! [X789] : ~ v1_xboole_0(k1_zfmisc_1(X789)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
fof(c_0_19,plain,
! [X153] :
( v3_struct_0(X153)
| ~ l1_pre_topc(X153)
| m1_subset_1(k1_lopclset(X153),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X153)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_20,plain,
! [X154] :
( v3_struct_0(X154)
| ~ v2_pre_topc(X154)
| ~ l1_pre_topc(X154)
| ~ v1_xboole_0(k1_lopclset(X154)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_21,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( v3_struct_0(X1)
| u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( m1_subset_1(X1,X3)
| v1_xboole_0(X2)
| v1_xboole_0(X3)
| ~ m2_subset_1(X1,X2,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( v3_struct_0(X1)
| m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( v3_struct_0(X1)
| m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( v3_struct_0(X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ v1_xboole_0(k1_lopclset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_32,plain,
( v3_struct_0(X1)
| m1_subset_1(k2_pre_topc(X1),k1_lopclset(X1))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 3.66/3.74 % Problem : LAT286+4 : TPTP v8.1.2. Released v3.4.0.
% 3.66/3.76 % Command : run_E %s %d THM
% 3.74/3.96 % Computer : n012.cluster.edu
% 3.74/3.96 % Model : x86_64 x86_64
% 3.74/3.96 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 3.74/3.96 % Memory : 8042.1875MB
% 3.74/3.96 % OS : Linux 3.10.0-693.el7.x86_64
% 3.74/3.96 % CPULimit : 300
% 3.74/3.96 % WCLimit : 300
% 3.74/3.96 % DateTime : Fri May 3 08:18:17 EDT 2024
% 3.74/3.96 % CPUTime :
% 16.87/17.19 Running first-order theorem proving
% 16.87/17.19 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.UDRNpBm3Z2/E---3.1_27952.p
% 37.14/21.27 # Version: 3.1.0
% 37.14/21.27 # Preprocessing class: FMLLMLLLSSSNFFN.
% 37.14/21.27 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 37.14/21.27 # Starting new_bool_3 with 897s (3) cores
% 37.14/21.27 # Starting new_bool_1 with 897s (3) cores
% 37.14/21.27 # Starting sh5l with 299s (1) cores
% 37.14/21.27 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 37.14/21.27 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 28035 completed with status 0
% 37.14/21.27 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 37.14/21.27 # Preprocessing class: FMLLMLLLSSSNFFN.
% 37.14/21.27 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 37.14/21.27 # Starting new_bool_3 with 897s (3) cores
% 37.14/21.27 # Starting new_bool_1 with 897s (3) cores
% 37.14/21.27 # Starting sh5l with 299s (1) cores
% 37.14/21.27 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 37.14/21.27 # SinE strategy is gf120_h_gu_R02_F100_L20000
% 37.14/21.27 # Search class: FGHSM-FMLM32-DFFFFFNN
% 37.14/21.27 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 37.14/21.27 # Starting new_ho_10 with 54s (1) cores
% 37.14/21.27 # new_ho_10 with pid 28036 completed with status 0
% 37.14/21.27 # Result found by new_ho_10
% 37.14/21.27 # Preprocessing class: FMLLMLLLSSSNFFN.
% 37.14/21.27 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 37.14/21.27 # Starting new_bool_3 with 897s (3) cores
% 37.14/21.27 # Starting new_bool_1 with 897s (3) cores
% 37.14/21.27 # Starting sh5l with 299s (1) cores
% 37.14/21.27 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 37.14/21.27 # SinE strategy is gf120_h_gu_R02_F100_L20000
% 37.14/21.27 # Search class: FGHSM-FMLM32-DFFFFFNN
% 37.14/21.27 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 37.14/21.27 # Starting new_ho_10 with 54s (1) cores
% 37.14/21.27 # Preprocessing time : 0.039 s
% 37.14/21.27 # Presaturation interreduction done
% 37.14/21.27
% 37.14/21.27 # Proof found!
% 37.14/21.27 # SZS status Theorem
% 37.14/21.27 # SZS output start CNFRefutation
% See solution above
% 37.14/21.27 # Parsed axioms : 32138
% 37.14/21.27 # Removed by relevancy pruning/SinE : 31671
% 37.14/21.27 # Initial clauses : 960
% 37.14/21.27 # Removed in clause preprocessing : 27
% 37.14/21.27 # Initial clauses in saturation : 933
% 37.14/21.27 # Processed clauses : 4650
% 37.14/21.27 # ...of these trivial : 79
% 37.14/21.27 # ...subsumed : 1436
% 37.14/21.27 # ...remaining for further processing : 3135
% 37.14/21.27 # Other redundant clauses eliminated : 263
% 37.14/21.27 # Clauses deleted for lack of memory : 0
% 37.14/21.27 # Backward-subsumed : 77
% 37.14/21.27 # Backward-rewritten : 57
% 37.14/21.27 # Generated clauses : 60355
% 37.14/21.27 # ...of the previous two non-redundant : 55888
% 37.14/21.27 # ...aggressively subsumed : 0
% 37.14/21.27 # Contextual simplify-reflections : 163
% 37.14/21.27 # Paramodulations : 60074
% 37.14/21.27 # Factorizations : 12
% 37.14/21.27 # NegExts : 0
% 37.14/21.27 # Equation resolutions : 270
% 37.14/21.27 # Disequality decompositions : 0
% 37.14/21.27 # Total rewrite steps : 12862
% 37.14/21.27 # ...of those cached : 11057
% 37.14/21.27 # Propositional unsat checks : 0
% 37.14/21.27 # Propositional check models : 0
% 37.14/21.27 # Propositional check unsatisfiable : 0
% 37.14/21.27 # Propositional clauses : 0
% 37.14/21.27 # Propositional clauses after purity: 0
% 37.14/21.27 # Propositional unsat core size : 0
% 37.14/21.27 # Propositional preprocessing time : 0.000
% 37.14/21.27 # Propositional encoding time : 0.000
% 37.14/21.27 # Propositional solver time : 0.000
% 37.14/21.27 # Success case prop preproc time : 0.000
% 37.14/21.27 # Success case prop encoding time : 0.000
% 37.14/21.27 # Success case prop solver time : 0.000
% 37.14/21.27 # Current number of processed clauses : 2063
% 37.14/21.27 # Positive orientable unit clauses : 136
% 37.14/21.27 # Positive unorientable unit clauses: 5
% 37.14/21.27 # Negative unit clauses : 79
% 37.14/21.27 # Non-unit-clauses : 1843
% 37.14/21.27 # Current number of unprocessed clauses: 52612
% 37.14/21.27 # ...number of literals in the above : 269479
% 37.14/21.27 # Current number of archived formulas : 0
% 37.14/21.27 # Current number of archived clauses : 1006
% 37.14/21.27 # Clause-clause subsumption calls (NU) : 1165264
% 37.14/21.27 # Rec. Clause-clause subsumption calls : 176476
% 37.14/21.27 # Non-unit clause-clause subsumptions : 989
% 37.14/21.27 # Unit Clause-clause subsumption calls : 30491
% 37.14/21.27 # Rewrite failures with RHS unbound : 0
% 37.14/21.27 # BW rewrite match attempts : 491
% 37.14/21.27 # BW rewrite match successes : 209
% 37.14/21.27 # Condensation attempts : 4656
% 37.14/21.27 # Condensation successes : 34
% 37.14/21.27 # Termbank termtop insertions : 2123998
% 37.14/21.27 # Search garbage collected termcells : 328668
% 37.14/21.27
% 37.14/21.27 # -------------------------------------------------
% 37.14/21.27 # User time : 2.467 s
% 37.14/21.27 # System time : 0.149 s
% 37.14/21.27 # Total time : 2.616 s
% 37.14/21.27 # Maximum resident set size: 62328 pages
% 37.14/21.27
% 37.14/21.27 # -------------------------------------------------
% 37.14/21.27 # User time : 3.807 s
% 37.14/21.27 # System time : 0.193 s
% 37.14/21.27 # Total time : 4.000 s
% 37.14/21.27 # Maximum resident set size: 49632 pages
% 37.14/21.27 % E---3.1 exiting
% 37.14/21.28 % E exiting
%------------------------------------------------------------------------------