TSTP Solution File: LCL621^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL621^1 : TPTP v8.2.0. Released v3.6.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:47:00 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 23
% Syntax : Number of formulae : 49 ( 18 unt; 14 typ; 0 def)
% Number of atoms : 82 ( 15 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 290 ( 39 ~; 38 |; 13 &; 192 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 99 ( 99 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 95 ( 38 ^ 53 !; 4 ?; 95 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_29,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_41,type,
esk1_3: ( $i > $i > $o ) > ( $i > $o ) > $i > $i ).
thf(decl_42,type,
epred1_0: $i > $i > $o ).
thf(decl_43,type,
epred2_0: $i > $o ).
thf(decl_44,type,
epred3_0: $i > $o ).
thf(decl_45,type,
esk2_0: $i ).
thf(decl_46,type,
esk3_1: $i > $i ).
thf(decl_47,type,
esk4_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(mbox,axiom,
( mbox
= ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
! [X12: $i] :
( ( X10 @ X1 @ X12 )
=> ( X11 @ X12 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X5: $i > $o,X3: $i] :
( ( X6 @ X3 )
& ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mand) ).
thf(mdia,axiom,
( mdia
= ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
? [X13: $i] :
( ( X10 @ X1 @ X13 )
& ( X11 @ X13 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mdia) ).
thf(k4,axiom,
! [X10: $i > $i > $o,X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ X10 @ X19 ) @ ( mbox @ X10 @ ( mbox @ X10 @ X19 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k4) ).
thf(thm,conjecture,
! [X10: $i > $i > $o,X20: $i > $o,X5: $i > $o] : ( mvalid @ ( mimpl @ ( mand @ ( mbox @ X10 @ ( mdia @ X10 @ X20 ) ) @ ( mbox @ X10 @ X5 ) ) @ ( mbox @ X10 @ ( mdia @ X10 @ ( mand @ X20 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(c_0_9,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_13,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X12: $i] :
( ( Z0 @ Z2 @ X12 )
=> ( Z1 @ X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_14,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_15,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_16,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
? [X13: $i] :
( ( Z0 @ Z2 @ X13 )
& ( Z1 @ X13 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_17,plain,
! [X10: $i > $i > $o,X19: $i > $o,X29: $i] :
( ~ ! [X26: $i] :
( ( X10 @ X29 @ X26 )
=> ( X19 @ X26 ) )
| ! [X28: $i] :
( ( X10 @ X29 @ X28 )
=> ! [X27: $i] :
( ( X10 @ X28 @ X27 )
=> ( X19 @ X27 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[k4,c_0_12]),c_0_13]),c_0_14]) ).
thf(c_0_18,negated_conjecture,
~ ! [X10: $i > $i > $o,X20: $i > $o,X5: $i > $o,X35: $i] :
( ~ ( ! [X31: $i] :
( ( X10 @ X35 @ X31 )
=> ? [X30: $i] :
( ( X10 @ X31 @ X30 )
& ( X20 @ X30 ) ) )
& ! [X32: $i] :
( ( X10 @ X35 @ X32 )
=> ( X5 @ X32 ) ) )
| ! [X34: $i] :
( ( X10 @ X35 @ X34 )
=> ? [X33: $i] :
( ( X10 @ X34 @ X33 )
& ( X20 @ X33 )
& ( X5 @ X33 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_15]),c_0_12]),c_0_13]),c_0_16]),c_0_14]) ).
thf(c_0_19,plain,
! [X36: $i > $i > $o,X37: $i > $o,X38: $i,X40: $i,X41: $i] :
( ( ( X36 @ X38 @ ( esk1_3 @ X36 @ X37 @ X38 ) )
| ~ ( X36 @ X38 @ X40 )
| ~ ( X36 @ X40 @ X41 )
| ( X37 @ X41 ) )
& ( ~ ( X37 @ ( esk1_3 @ X36 @ X37 @ X38 ) )
| ~ ( X36 @ X38 @ X40 )
| ~ ( X36 @ X40 @ X41 )
| ( X37 @ X41 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])]) ).
thf(c_0_20,negated_conjecture,
! [X46: $i,X48: $i,X50: $i] :
( ( ( epred1_0 @ X46 @ ( esk3_1 @ X46 ) )
| ~ ( epred1_0 @ esk2_0 @ X46 ) )
& ( ( epred2_0 @ ( esk3_1 @ X46 ) )
| ~ ( epred1_0 @ esk2_0 @ X46 ) )
& ( ~ ( epred1_0 @ esk2_0 @ X48 )
| ( epred3_0 @ X48 ) )
& ( epred1_0 @ esk2_0 @ esk4_0 )
& ( ~ ( epred1_0 @ esk4_0 @ X50 )
| ~ ( epred2_0 @ X50 )
| ~ ( epred3_0 @ X50 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])]) ).
thf(c_0_21,plain,
! [X1: $i,X2: $i > $o,X3: $i,X10: $i > $i > $o,X12: $i] :
( ( X10 @ X1 @ ( esk1_3 @ X10 @ X2 @ X1 ) )
| ( X2 @ X12 )
| ~ ( X10 @ X1 @ X3 )
| ~ ( X10 @ X3 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 @ ( esk3_1 @ X1 ) )
| ~ ( epred1_0 @ esk2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i] :
( ~ ( epred1_0 @ esk4_0 @ X1 )
| ~ ( epred2_0 @ X1 )
| ~ ( epred3_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
epred1_0 @ esk2_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_25,plain,
! [X1: $i,X2: $i > $o,X3: $i,X10: $i > $i > $o,X12: $i] :
( ( X2 @ X12 )
| ~ ( X2 @ ( esk1_3 @ X10 @ X2 @ X1 ) )
| ~ ( X10 @ X1 @ X3 )
| ~ ( X10 @ X3 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i] :
( ( epred3_0 @ X1 )
| ~ ( epred1_0 @ esk2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( epred1_0 @ X1 @ ( esk1_3 @ epred1_0 @ X2 @ X1 ) )
| ( X2 @ ( esk3_1 @ X3 ) )
| ~ ( epred1_0 @ esk2_0 @ X3 )
| ~ ( epred1_0 @ X1 @ X3 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_28,negated_conjecture,
( ~ ( epred2_0 @ ( esk3_1 @ esk4_0 ) )
| ~ ( epred3_0 @ ( esk3_1 @ esk4_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_24])]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ ( esk3_1 @ X1 ) )
| ~ ( epred1_0 @ esk2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i] :
( ( X2 @ ( esk3_1 @ X1 ) )
| ~ ( X2 @ ( esk1_3 @ epred1_0 @ X2 @ X3 ) )
| ~ ( epred1_0 @ esk2_0 @ X1 )
| ~ ( epred1_0 @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
thf(c_0_31,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( epred3_0 @ ( esk1_3 @ epred1_0 @ X2 @ esk2_0 ) )
| ( X2 @ ( esk3_1 @ X1 ) )
| ~ ( epred1_0 @ esk2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_32,negated_conjecture,
~ ( epred3_0 @ ( esk3_1 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24])]) ).
thf(c_0_33,negated_conjecture,
! [X1: $i] :
( ( epred3_0 @ ( esk3_1 @ X1 ) )
| ~ ( epred1_0 @ esk2_0 @ X1 ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31])]) ).
thf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : LCL621^1 : TPTP v8.2.0. Released v3.6.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Mon May 20 00:54:07 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.13/0.37 Running higher-order theorem proving
% 0.13/0.37 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Version: 3.1.0-ho
% 0.13/0.38 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting new_ho_9 with 1500s (5) cores
% 0.13/0.38 # Starting post_as_ho1 with 300s (1) cores
% 0.13/0.38 # Starting sh1l with 300s (1) cores
% 0.13/0.38 # Starting post_as_ho10 with 300s (1) cores
% 0.13/0.38 # new_ho_9 with pid 1716 completed with status 0
% 0.13/0.38 # Result found by new_ho_9
% 0.13/0.38 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting new_ho_9 with 1500s (5) cores
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Search class: HGHNF-FFSF32-SHSSMSBN
% 0.13/0.38 # partial match(1): HGUNF-FFSF32-SHSSMSBN
% 0.13/0.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.38 # Starting new_ho_10_cnf2 with 811s (1) cores
% 0.13/0.38 # Starting new_ho_9 with 151s (1) cores
% 0.13/0.38 # Starting full_lambda_5 with 136s (1) cores
% 0.13/0.38 # Starting post_as_ho4 with 136s (1) cores
% 0.13/0.38 # Starting pre_casc_3 with 136s (1) cores
% 0.13/0.38 # pre_casc_3 with pid 1724 completed with status 0
% 0.13/0.38 # Result found by pre_casc_3
% 0.13/0.38 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting new_ho_9 with 1500s (5) cores
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Search class: HGHNF-FFSF32-SHSSMSBN
% 0.13/0.38 # partial match(1): HGUNF-FFSF32-SHSSMSBN
% 0.13/0.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.38 # Starting new_ho_10_cnf2 with 811s (1) cores
% 0.13/0.38 # Starting new_ho_9 with 151s (1) cores
% 0.13/0.38 # Starting full_lambda_5 with 136s (1) cores
% 0.13/0.38 # Starting post_as_ho4 with 136s (1) cores
% 0.13/0.38 # Starting pre_casc_3 with 136s (1) cores
% 0.13/0.38 # Preprocessing time : 0.001 s
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38
% 0.13/0.38 # Proof found!
% 0.13/0.38 # SZS status Theorem
% 0.13/0.38 # SZS output start CNFRefutation
% See solution above
% 0.13/0.38 # Parsed axioms : 37
% 0.13/0.38 # Removed by relevancy pruning/SinE : 0
% 0.13/0.38 # Initial clauses : 27
% 0.13/0.38 # Removed in clause preprocessing : 20
% 0.13/0.38 # Initial clauses in saturation : 7
% 0.13/0.38 # Processed clauses : 30
% 0.13/0.38 # ...of these trivial : 0
% 0.13/0.38 # ...subsumed : 1
% 0.13/0.38 # ...remaining for further processing : 29
% 0.13/0.38 # Other redundant clauses eliminated : 0
% 0.13/0.38 # Clauses deleted for lack of memory : 0
% 0.13/0.38 # Backward-subsumed : 2
% 0.13/0.38 # Backward-rewritten : 0
% 0.13/0.38 # Generated clauses : 45
% 0.13/0.38 # ...of the previous two non-redundant : 38
% 0.13/0.38 # ...aggressively subsumed : 0
% 0.13/0.38 # Contextual simplify-reflections : 0
% 0.13/0.38 # Paramodulations : 45
% 0.13/0.38 # Factorizations : 0
% 0.13/0.38 # NegExts : 0
% 0.13/0.38 # Equation resolutions : 0
% 0.13/0.38 # Disequality decompositions : 0
% 0.13/0.38 # Total rewrite steps : 10
% 0.13/0.38 # ...of those cached : 8
% 0.13/0.38 # Propositional unsat checks : 0
% 0.13/0.38 # Propositional check models : 0
% 0.13/0.38 # Propositional check unsatisfiable : 0
% 0.13/0.38 # Propositional clauses : 0
% 0.13/0.38 # Propositional clauses after purity: 0
% 0.13/0.38 # Propositional unsat core size : 0
% 0.13/0.38 # Propositional preprocessing time : 0.000
% 0.13/0.38 # Propositional encoding time : 0.000
% 0.13/0.38 # Propositional solver time : 0.000
% 0.13/0.38 # Success case prop preproc time : 0.000
% 0.13/0.38 # Success case prop encoding time : 0.000
% 0.13/0.38 # Success case prop solver time : 0.000
% 0.13/0.38 # Current number of processed clauses : 20
% 0.13/0.38 # Positive orientable unit clauses : 2
% 0.13/0.38 # Positive unorientable unit clauses: 0
% 0.13/0.38 # Negative unit clauses : 1
% 0.13/0.38 # Non-unit-clauses : 17
% 0.13/0.38 # Current number of unprocessed clauses: 22
% 0.13/0.38 # ...number of literals in the above : 113
% 0.13/0.38 # Current number of archived formulas : 0
% 0.13/0.38 # Current number of archived clauses : 9
% 0.13/0.38 # Clause-clause subsumption calls (NU) : 61
% 0.13/0.38 # Rec. Clause-clause subsumption calls : 37
% 0.13/0.38 # Non-unit clause-clause subsumptions : 3
% 0.13/0.38 # Unit Clause-clause subsumption calls : 2
% 0.13/0.38 # Rewrite failures with RHS unbound : 0
% 0.13/0.38 # BW rewrite match attempts : 0
% 0.13/0.38 # BW rewrite match successes : 0
% 0.13/0.38 # Condensation attempts : 30
% 0.13/0.38 # Condensation successes : 1
% 0.13/0.38 # Termbank termtop insertions : 2888
% 0.13/0.38 # Search garbage collected termcells : 577
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.003 s
% 0.13/0.38 # System time : 0.003 s
% 0.13/0.38 # Total time : 0.006 s
% 0.13/0.38 # Maximum resident set size: 1916 pages
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.016 s
% 0.13/0.38 # System time : 0.009 s
% 0.13/0.38 # Total time : 0.025 s
% 0.13/0.38 # Maximum resident set size: 1784 pages
% 0.13/0.38 % E---3.1 exiting
% 0.13/0.38 % E exiting
%------------------------------------------------------------------------------