TSTP Solution File: LCL736^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL736^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:53:17 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 17 ( 2 unt; 8 typ; 0 def)
% Number of atoms : 14 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 133 ( 7 ~; 10 |; 3 &; 107 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 106 ( 106 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 1 con; 0-3 aty)
% Number of variables : 37 ( 0 ^ 25 !; 12 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_22,type,
epred1_2: ( ( b > $o ) > b > b > $o ) > ( ( b > $o ) > b > b > $o ) > b > $o ).
thf(decl_23,type,
esk1_2: ( ( b > $o ) > b > b > $o ) > ( ( b > $o ) > b > b > $o ) > ( b > $o ) > b ).
thf(decl_24,type,
esk2_3: ( ( b > $o ) > b > b > $o ) > ( ( b > $o ) > b > b > $o ) > ( b > $o ) > b ).
thf(decl_25,type,
esk3_3: ( ( b > $o ) > b > b > $o ) > ( ( b > $o ) > b > b > $o ) > ( b > $o ) > b ).
thf(decl_26,type,
epred2_1: ( ( b > $o ) > b ) > b > $o ).
thf(decl_27,type,
esk4_1: ( ( b > $o ) > b ) > b ).
thf(decl_28,type,
esk5_0: ( b > $o ) > b ).
thf(cX5310D,conjecture,
( ! [X1: ( b > $o ) > b > b > $o,X2: ( b > $o ) > b > b > $o] :
( ! [X3: b > $o] :
? [X4: b,X5: b] :
( ( X1 @ X3 @ X4 @ X5 )
| ( X2 @ X3 @ X4 @ X5 ) )
=> ? [X6: ( b > $o ) > b] :
! [X3: b > $o] :
? [X5: b] :
( ( X1 @ X3 @ ( X6 @ X3 ) @ X5 )
| ( X2 @ X3 @ ( X6 @ X3 ) @ X5 ) ) )
=> ? [X7: ( b > $o ) > b] :
! [X8: b > $o] :
( ? [X9: b] : ( X8 @ X9 )
=> ( X8 @ ( X7 @ X8 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5310D) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: ( b > $o ) > b > b > $o,X2: ( b > $o ) > b > b > $o] :
( ! [X3: b > $o] :
? [X4: b,X5: b] :
( ( X1 @ X3 @ X4 @ X5 )
| ( X2 @ X3 @ X4 @ X5 ) )
=> ? [X6: ( b > $o ) > b] :
! [X3: b > $o] :
? [X5: b] :
( ( X1 @ X3 @ ( X6 @ X3 ) @ X5 )
| ( X2 @ X3 @ ( X6 @ X3 ) @ X5 ) ) )
=> ? [X7: ( b > $o ) > b] :
! [X8: b > $o] :
( ? [X9: b] : ( X8 @ X9 )
=> ( X8 @ ( X7 @ X8 ) ) ) ),
inference(assume_negation,[status(cth)],[cX5310D]) ).
thf(c_0_2,negated_conjecture,
! [X21: ( b > $o ) > b > b > $o,X22: ( b > $o ) > b > b > $o,X24: b,X25: b,X26: b,X27: b,X29: b > $o,X32: ( b > $o ) > b] :
( ( ~ ( X21 @ ( epred1_2 @ X21 @ X22 ) @ X24 @ X25 )
| ( X21 @ X29 @ ( esk1_2 @ X21 @ X22 @ X29 ) @ ( esk2_3 @ X21 @ X22 @ X29 ) )
| ( X22 @ X29 @ ( esk1_2 @ X21 @ X22 @ X29 ) @ ( esk3_3 @ X21 @ X22 @ X29 ) ) )
& ( ~ ( X22 @ ( epred1_2 @ X21 @ X22 ) @ X26 @ X27 )
| ( X21 @ X29 @ ( esk1_2 @ X21 @ X22 @ X29 ) @ ( esk2_3 @ X21 @ X22 @ X29 ) )
| ( X22 @ X29 @ ( esk1_2 @ X21 @ X22 @ X29 ) @ ( esk3_3 @ X21 @ X22 @ X29 ) ) )
& ( epred2_1 @ X32 @ ( esk4_1 @ X32 ) )
& ~ ( epred2_1 @ X32 @ ( X32 @ ( epred2_1 @ X32 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X6: ( b > $o ) > b] :
~ ( epred2_1 @ X6 @ ( X6 @ ( epred2_1 @ X6 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
! [X35: b > $o,X36: b] :
( ( X35 @ ( esk5_0 @ X35 ) )
| ~ ( X35 @ X36 ) ),
inference(introduce_choice_axiom,[status(thm)],]) ).
thf(c_0_5,negated_conjecture,
! [X6: ( b > $o ) > b,X4: b] :
( ( epred2_1 @ X6 @ ( esk5_0 @ ( epred2_1 @ X6 ) ) )
| ~ ( epred2_1 @ X6 @ X4 ) ),
inference(choice_inst,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X6: ( b > $o ) > b] : ( epred2_1 @ X6 @ ( esk4_1 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X6: ( b > $o ) > b] : ( epred2_1 @ X6 @ ( esk5_0 @ ( epred2_1 @ X6 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_3,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL736^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 02:59:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running higher-order theorem proving
% 0.21/0.47 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.21/0.49 # Version: 3.1.0-ho
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting sh2lt with 1200s (4) cores
% 0.21/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.21/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.49 # Starting ehoh_best3_rw with 300s (1) cores
% 0.21/0.49 # sh2lt with pid 29583 completed with status 0
% 0.21/0.49 # Result found by sh2lt
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting sh2lt with 1200s (4) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.21/0.49 # Search class: HGUNF-FFSF32-SHHFFMBN
% 0.21/0.49 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.21/0.49 # Starting ho_unfolding_3 with 649s (1) cores
% 0.21/0.49 # Starting sh2lt with 121s (1) cores
% 0.21/0.49 # Starting sh5l with 109s (1) cores
% 0.21/0.49 # Starting new_bool_3 with 109s (1) cores
% 0.21/0.49 # sh2lt with pid 29589 completed with status 0
% 0.21/0.49 # Result found by sh2lt
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting sh2lt with 1200s (4) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.21/0.49 # Search class: HGUNF-FFSF32-SHHFFMBN
% 0.21/0.49 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.21/0.49 # Starting ho_unfolding_3 with 649s (1) cores
% 0.21/0.49 # Starting sh2lt with 121s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 2
% 0.21/0.49 # Removed by relevancy pruning/SinE : 1
% 0.21/0.49 # Initial clauses : 4
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 4
% 0.21/0.49 # Processed clauses : 8
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 8
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 1
% 0.21/0.49 # Generated clauses : 4
% 0.21/0.49 # ...of the previous two non-redundant : 3
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 2
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 1
% 0.21/0.49 # ...of those cached : 0
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 3
% 0.21/0.49 # Positive orientable unit clauses : 2
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 0
% 0.21/0.49 # Current number of unprocessed clauses: 3
% 0.21/0.49 # ...number of literals in the above : 8
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 6
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 2
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 2
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 0
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 1
% 0.21/0.49 # BW rewrite match successes : 1
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 824
% 0.21/0.49 # Search garbage collected termcells : 250
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.006 s
% 0.21/0.49 # Maximum resident set size: 1852 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.010 s
% 0.21/0.49 # System time : 0.007 s
% 0.21/0.49 # Total time : 0.018 s
% 0.21/0.49 # Maximum resident set size: 1720 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------