TSTP Solution File: LAT287+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT287+4 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 44.27s 6.98s
% Output : CNFRefutation 44.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 113 ( 4 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 130 ( 51 ~; 39 |; 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(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/benchmark/Axioms/SET007/SET007+7.ax',redefinition_m2_subset_1) ).
fof(t7_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_lopclset) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',fc1_subset_1) ).
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(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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',fc1_lopclset) ).
fof(c_0_7,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_8,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[t7_lopclset]) ).
fof(c_0_9,plain,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_10,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_11,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_12,plain,
! [X1017,X1018,X1019] :
( ( ~ m2_subset_1(X1019,X1017,X1018)
| m1_subset_1(X1019,X1018)
| v1_xboole_0(X1017)
| v1_xboole_0(X1018)
| ~ m1_subset_1(X1018,k1_zfmisc_1(X1017)) )
& ( ~ m1_subset_1(X1019,X1018)
| m2_subset_1(X1019,X1017,X1018)
| v1_xboole_0(X1017)
| v1_xboole_0(X1018)
| ~ m1_subset_1(X1018,k1_zfmisc_1(X1017)) ) ),
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_7])])])])]) ).
fof(c_0_13,plain,
! [X152] :
( v3_struct_0(X152)
| ~ v2_pre_topc(X152)
| ~ l1_pre_topc(X152)
| m2_subset_1(k1_pre_topc(X152),k1_zfmisc_1(u1_struct_0(X152)),k1_lopclset(X152)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_14,plain,
! [X1004] : ~ v1_xboole_0(k1_zfmisc_1(X1004)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
fof(c_0_15,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_10])])])]) ).
fof(c_0_16,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_11])])]) ).
fof(c_0_17,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_18,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]) ).
cnf(c_0_19,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_12]) ).
cnf(c_0_20,plain,
( v3_struct_0(X1)
| m2_subset_1(k1_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_13]) ).
cnf(c_0_21,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,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_16]) ).
cnf(c_0_24,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_27,plain,
! [X144] :
( v3_struct_0(X144)
| ~ l1_pre_topc(X144)
| m1_subset_1(k1_lopclset(X144),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X144)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_28,plain,
! [X145] :
( v3_struct_0(X145)
| ~ v2_pre_topc(X145)
| ~ l1_pre_topc(X145)
| ~ v1_xboole_0(k1_lopclset(X145)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
cnf(c_0_29,plain,
( m1_subset_1(k1_pre_topc(X1),k1_lopclset(X1))
| v1_xboole_0(k1_lopclset(X1))
| v3_struct_0(X1)
| ~ m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_30,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_22,c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_31,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_27]) ).
cnf(c_0_32,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_28]) ).
cnf(c_0_33,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_29,c_0_30,c_0_31,c_0_32,c_0_26,c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : LAT287+4 : TPTP v8.2.0. Released v3.4.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Sun May 19 21:09:41 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.13/0.37 Running first-order theorem proving
% 0.13/0.37 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
% 44.27/6.98 # Version: 3.1.0
% 44.27/6.98 # Preprocessing class: FMLLMLLLSSSNFFN.
% 44.27/6.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.27/6.98 # Starting new_bool_3 with 900s (3) cores
% 44.27/6.98 # Starting new_bool_1 with 900s (3) cores
% 44.27/6.98 # Starting sh5l with 300s (1) cores
% 44.27/6.98 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 300s (1) cores
% 44.27/6.98 # new_bool_3 with pid 30327 completed with status 0
% 44.27/6.98 # Result found by new_bool_3
% 44.27/6.98 # Preprocessing class: FMLLMLLLSSSNFFN.
% 44.27/6.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.27/6.98 # Starting new_bool_3 with 900s (3) cores
% 44.27/6.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 44.27/6.98 # Search class: FGHSM-SMLM32-DFFFFFNN
% 44.27/6.98 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 44.27/6.98 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 44.27/6.98 # Starting new_bool_3 with 91s (1) cores
% 44.27/6.98 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 44.27/6.98 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 30337 completed with status 0
% 44.27/6.98 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 44.27/6.98 # Preprocessing class: FMLLMLLLSSSNFFN.
% 44.27/6.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.27/6.98 # Starting new_bool_3 with 900s (3) cores
% 44.27/6.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 44.27/6.98 # Search class: FGHSM-SMLM32-DFFFFFNN
% 44.27/6.98 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 44.27/6.98 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 44.27/6.98 # Starting new_bool_3 with 91s (1) cores
% 44.27/6.98 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 44.27/6.98 # Preprocessing time : 0.092 s
% 44.27/6.98 # SatCheck found unsatisfiable ground set
% 44.27/6.98
% 44.27/6.98 # Proof found!
% 44.27/6.98 # SZS status Theorem
% 44.27/6.98 # SZS output start CNFRefutation
% See solution above
% 44.27/6.98 # Parsed axioms : 32139
% 44.27/6.98 # Removed by relevancy pruning/SinE : 29731
% 44.27/6.98 # Initial clauses : 5622
% 44.27/6.98 # Removed in clause preprocessing : 143
% 44.27/6.98 # Initial clauses in saturation : 5479
% 44.27/6.98 # Processed clauses : 5337
% 44.27/6.98 # ...of these trivial : 36
% 44.27/6.98 # ...subsumed : 301
% 44.27/6.98 # ...remaining for further processing : 5000
% 44.27/6.98 # Other redundant clauses eliminated : 938
% 44.27/6.98 # Clauses deleted for lack of memory : 0
% 44.27/6.98 # Backward-subsumed : 5
% 44.27/6.98 # Backward-rewritten : 7
% 44.27/6.98 # Generated clauses : 154971
% 44.27/6.98 # ...of the previous two non-redundant : 150398
% 44.27/6.98 # ...aggressively subsumed : 0
% 44.27/6.98 # Contextual simplify-reflections : 245
% 44.27/6.98 # Paramodulations : 153995
% 44.27/6.98 # Factorizations : 28
% 44.27/6.98 # NegExts : 0
% 44.27/6.98 # Equation resolutions : 980
% 44.27/6.98 # Disequality decompositions : 0
% 44.27/6.98 # Total rewrite steps : 8489
% 44.27/6.98 # ...of those cached : 7171
% 44.27/6.98 # Propositional unsat checks : 1
% 44.27/6.98 # Propositional check models : 0
% 44.27/6.98 # Propositional check unsatisfiable : 1
% 44.27/6.98 # Propositional clauses : 155186
% 44.27/6.98 # Propositional clauses after purity: 32748
% 44.27/6.98 # Propositional unsat core size : 7
% 44.27/6.98 # Propositional preprocessing time : 0.000
% 44.27/6.98 # Propositional encoding time : 0.352
% 44.27/6.98 # Propositional solver time : 0.046
% 44.27/6.98 # Success case prop preproc time : 0.000
% 44.27/6.98 # Success case prop encoding time : 0.352
% 44.27/6.98 # Success case prop solver time : 0.046
% 44.27/6.98 # Current number of processed clauses : 4646
% 44.27/6.98 # Positive orientable unit clauses : 505
% 44.27/6.98 # Positive unorientable unit clauses: 8
% 44.27/6.98 # Negative unit clauses : 70
% 44.27/6.98 # Non-unit-clauses : 4063
% 44.27/6.98 # Current number of unprocessed clauses: 150540
% 44.27/6.98 # ...number of literals in the above : 1082812
% 44.27/6.98 # Current number of archived formulas : 0
% 44.27/6.98 # Current number of archived clauses : 12
% 44.27/6.98 # Clause-clause subsumption calls (NU) : 10716853
% 44.27/6.98 # Rec. Clause-clause subsumption calls : 761436
% 44.27/6.98 # Non-unit clause-clause subsumptions : 532
% 44.27/6.98 # Unit Clause-clause subsumption calls : 101970
% 44.27/6.98 # Rewrite failures with RHS unbound : 0
% 44.27/6.98 # BW rewrite match attempts : 143
% 44.27/6.98 # BW rewrite match successes : 105
% 44.27/6.98 # Condensation attempts : 0
% 44.27/6.98 # Condensation successes : 0
% 44.27/6.98 # Termbank termtop insertions : 7066435
% 44.27/6.98 # Search garbage collected termcells : 398860
% 44.27/6.98
% 44.27/6.98 # -------------------------------------------------
% 44.27/6.98 # User time : 5.420 s
% 44.27/6.98 # System time : 0.217 s
% 44.27/6.98 # Total time : 5.637 s
% 44.27/6.98 # Maximum resident set size: 66668 pages
% 44.27/6.98
% 44.27/6.98 # -------------------------------------------------
% 44.27/6.98 # User time : 16.303 s
% 44.27/6.98 # System time : 0.371 s
% 44.27/6.98 # Total time : 16.674 s
% 44.27/6.98 # Maximum resident set size: 49652 pages
% 44.27/6.98 % E---3.1 exiting
% 44.27/6.99 % E exiting
%------------------------------------------------------------------------------