TSTP Solution File: LAT287+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT287+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Mon May 20 23:24:18 EDT 2024
% Result : Theorem 3.53s 1.15s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 13 unt; 0 def)
% Number of atoms : 123 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 137 ( 54 ~; 42 |; 25 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-1 aty)
% Number of variables : 38 ( 1 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_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/benchmark/theBenchmark.p',t13_lopclset) ).
fof(d2_pre_topc,axiom,
! [X1] :
( l1_struct_0(X1)
=> k1_pre_topc(X1) = k1_xboole_0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+206.ax',d2_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+206.ax',dt_l1_pre_topc) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t1_subset) ).
fof(t4_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( ( v3_pre_topc(X2,X1)
& v4_pre_topc(X2,X1) )
=> r2_hidden(X2,k1_lopclset(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_lopclset) ).
fof(t4_subset_1,axiom,
! [X1] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',t4_subset_1) ).
fof(cc1_tops_1,axiom,
! [X1] :
( ( v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_xboole_0(X2)
=> ( v3_pre_topc(X2,X1)
& v4_pre_topc(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+207.ax',cc1_tops_1) ).
fof(fc6_membered,axiom,
( v1_xboole_0(k1_xboole_0)
& v1_membered(k1_xboole_0)
& v2_membered(k1_xboole_0)
& v3_membered(k1_xboole_0)
& v4_membered(k1_xboole_0)
& v5_membered(k1_xboole_0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+51.ax',fc6_membered) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t16_lopclset])]) ).
fof(c_0_10,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_11,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ~ m1_subset_1(k1_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_9])])])]) ).
fof(c_0_12,plain,
! [X23] :
( v3_struct_0(X23)
| ~ v2_pre_topc(X23)
| ~ l1_pre_topc(X23)
| u1_struct_0(k6_lopclset(X23)) = k1_lopclset(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_13,plain,
! [X27] :
( ~ l1_struct_0(X27)
| k1_pre_topc(X27) = k1_xboole_0 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_pre_topc])])]) ).
fof(c_0_14,plain,
! [X593] :
( ~ l1_pre_topc(X593)
| l1_struct_0(X593) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).
cnf(c_0_15,negated_conjecture,
~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,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_12]) ).
cnf(c_0_17,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( k1_pre_topc(X1) = k1_xboole_0
| ~ l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( l1_struct_0(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
~ m1_subset_1(k1_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_15,c_0_16]),c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_23,plain,
( k1_pre_topc(X1) = k1_xboole_0
| ~ l1_pre_topc(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X717,X718] :
( ~ r2_hidden(X717,X718)
| m1_subset_1(X717,X718) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
fof(c_0_25,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( ( v3_pre_topc(X2,X1)
& v4_pre_topc(X2,X1) )
=> r2_hidden(X2,k1_lopclset(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[t4_lopclset]) ).
cnf(c_0_26,negated_conjecture,
~ m1_subset_1(k1_xboole_0,k1_lopclset(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18])]) ).
cnf(c_0_27,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_28,plain,
! [X349,X350] :
( v3_struct_0(X349)
| ~ v2_pre_topc(X349)
| ~ l1_pre_topc(X349)
| ~ m1_subset_1(X350,k1_zfmisc_1(u1_struct_0(X349)))
| ~ v3_pre_topc(X350,X349)
| ~ v4_pre_topc(X350,X349)
| r2_hidden(X350,k1_lopclset(X349)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
fof(c_0_29,plain,
! [X621] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X621)),
inference(variable_rename,[status(thm)],[t4_subset_1]) ).
cnf(c_0_30,negated_conjecture,
~ r2_hidden(k1_xboole_0,k1_lopclset(esk1_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( v3_struct_0(X1)
| r2_hidden(X2,k1_lopclset(X1))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_pre_topc(X2,X1)
| ~ v4_pre_topc(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_33,plain,
! [X801,X802] :
( ( v3_pre_topc(X802,X801)
| ~ v1_xboole_0(X802)
| ~ m1_subset_1(X802,k1_zfmisc_1(u1_struct_0(X801)))
| ~ v2_pre_topc(X801)
| ~ l1_pre_topc(X801) )
& ( v4_pre_topc(X802,X801)
| ~ v1_xboole_0(X802)
| ~ m1_subset_1(X802,k1_zfmisc_1(u1_struct_0(X801)))
| ~ v2_pre_topc(X801)
| ~ l1_pre_topc(X801) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_tops_1])])])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ v3_pre_topc(k1_xboole_0,esk1_0)
| ~ v4_pre_topc(k1_xboole_0,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17]),c_0_18]),c_0_32])]),c_0_19]) ).
cnf(c_0_35,plain,
( v4_pre_topc(X1,X2)
| ~ v1_xboole_0(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_37,negated_conjecture,
~ v3_pre_topc(k1_xboole_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]),c_0_18]),c_0_32]),c_0_36])]) ).
cnf(c_0_38,plain,
( v3_pre_topc(X1,X2)
| ~ v1_xboole_0(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_17]),c_0_18]),c_0_32]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LAT287+2 : TPTP v8.2.0. Released v3.4.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 20:21:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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/benchmark/theBenchmark.p
% 3.53/1.15 # Version: 3.1.0
% 3.53/1.15 # Preprocessing class: FMLLSMLLSSSNFFN.
% 3.53/1.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.53/1.15 # Starting new_bool_3 with 900s (3) cores
% 3.53/1.15 # Starting new_bool_1 with 900s (3) cores
% 3.53/1.15 # Starting sh5l with 300s (1) cores
% 3.53/1.15 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 3.53/1.15 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 8805 completed with status 0
% 3.53/1.15 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 3.53/1.15 # Preprocessing class: FMLLSMLLSSSNFFN.
% 3.53/1.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.53/1.15 # Starting new_bool_3 with 900s (3) cores
% 3.53/1.15 # Starting new_bool_1 with 900s (3) cores
% 3.53/1.15 # Starting sh5l with 300s (1) cores
% 3.53/1.15 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 3.53/1.15 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 3.53/1.15 # Search class: FGHSM-FSLM32-MFFFFFNN
% 3.53/1.15 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 3.53/1.15 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 3.53/1.15 # G-E--_303_C18_F1_URBAN_S0Y with pid 8806 completed with status 0
% 3.53/1.15 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 3.53/1.15 # Preprocessing class: FMLLSMLLSSSNFFN.
% 3.53/1.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.53/1.15 # Starting new_bool_3 with 900s (3) cores
% 3.53/1.15 # Starting new_bool_1 with 900s (3) cores
% 3.53/1.15 # Starting sh5l with 300s (1) cores
% 3.53/1.15 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 3.53/1.15 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 3.53/1.15 # Search class: FGHSM-FSLM32-MFFFFFNN
% 3.53/1.15 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 3.53/1.15 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 3.53/1.15 # Preprocessing time : 0.027 s
% 3.53/1.15
% 3.53/1.15 # Proof found!
% 3.53/1.15 # SZS status Theorem
% 3.53/1.15 # SZS output start CNFRefutation
% See solution above
% 3.53/1.15 # Parsed axioms : 6428
% 3.53/1.15 # Removed by relevancy pruning/SinE : 5927
% 3.53/1.15 # Initial clauses : 1003
% 3.53/1.15 # Removed in clause preprocessing : 28
% 3.53/1.15 # Initial clauses in saturation : 975
% 3.53/1.15 # Processed clauses : 1129
% 3.53/1.15 # ...of these trivial : 14
% 3.53/1.15 # ...subsumed : 137
% 3.53/1.15 # ...remaining for further processing : 978
% 3.53/1.15 # Other redundant clauses eliminated : 64
% 3.53/1.15 # Clauses deleted for lack of memory : 0
% 3.53/1.15 # Backward-subsumed : 2
% 3.53/1.15 # Backward-rewritten : 13
% 3.53/1.15 # Generated clauses : 14258
% 3.53/1.15 # ...of the previous two non-redundant : 12970
% 3.53/1.15 # ...aggressively subsumed : 0
% 3.53/1.15 # Contextual simplify-reflections : 18
% 3.53/1.15 # Paramodulations : 14152
% 3.53/1.15 # Factorizations : 19
% 3.53/1.15 # NegExts : 0
% 3.53/1.15 # Equation resolutions : 88
% 3.53/1.15 # Disequality decompositions : 0
% 3.53/1.15 # Total rewrite steps : 4243
% 3.53/1.15 # ...of those cached : 3500
% 3.53/1.15 # Propositional unsat checks : 0
% 3.53/1.15 # Propositional check models : 0
% 3.53/1.15 # Propositional check unsatisfiable : 0
% 3.53/1.15 # Propositional clauses : 0
% 3.53/1.15 # Propositional clauses after purity: 0
% 3.53/1.15 # Propositional unsat core size : 0
% 3.53/1.15 # Propositional preprocessing time : 0.000
% 3.53/1.15 # Propositional encoding time : 0.000
% 3.53/1.15 # Propositional solver time : 0.000
% 3.53/1.15 # Success case prop preproc time : 0.000
% 3.53/1.15 # Success case prop encoding time : 0.000
% 3.53/1.15 # Success case prop solver time : 0.000
% 3.53/1.15 # Current number of processed clauses : 953
% 3.53/1.15 # Positive orientable unit clauses : 93
% 3.53/1.15 # Positive unorientable unit clauses: 3
% 3.53/1.15 # Negative unit clauses : 50
% 3.53/1.15 # Non-unit-clauses : 807
% 3.53/1.15 # Current number of unprocessed clauses: 12810
% 3.53/1.15 # ...number of literals in the above : 52303
% 3.53/1.15 # Current number of archived formulas : 0
% 3.53/1.15 # Current number of archived clauses : 16
% 3.53/1.15 # Clause-clause subsumption calls (NU) : 195691
% 3.53/1.15 # Rec. Clause-clause subsumption calls : 56895
% 3.53/1.15 # Non-unit clause-clause subsumptions : 125
% 3.53/1.15 # Unit Clause-clause subsumption calls : 15326
% 3.53/1.15 # Rewrite failures with RHS unbound : 0
% 3.53/1.15 # BW rewrite match attempts : 72
% 3.53/1.15 # BW rewrite match successes : 40
% 3.53/1.15 # Condensation attempts : 0
% 3.53/1.15 # Condensation successes : 0
% 3.53/1.15 # Termbank termtop insertions : 392387
% 3.53/1.15 # Search garbage collected termcells : 62765
% 3.53/1.15
% 3.53/1.15 # -------------------------------------------------
% 3.53/1.15 # User time : 0.416 s
% 3.53/1.15 # System time : 0.037 s
% 3.53/1.15 # Total time : 0.453 s
% 3.53/1.15 # Maximum resident set size: 13616 pages
% 3.53/1.15
% 3.53/1.15 # -------------------------------------------------
% 3.53/1.15 # User time : 0.578 s
% 3.53/1.15 # System time : 0.047 s
% 3.53/1.15 # Total time : 0.625 s
% 3.53/1.15 # Maximum resident set size: 9956 pages
% 3.53/1.15 % E---3.1 exiting
% 3.53/1.15 % E exiting
%------------------------------------------------------------------------------