TSTP Solution File: LCL733^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL733^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:16 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 13 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 87 ( 10 ~; 9 |; 3 &; 55 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 35 ( 0 ^ 23 !; 12 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_22,type,
epred1_0: b > $o ).
thf(decl_23,type,
esk1_1: b > b ).
thf(decl_24,type,
esk2_0: ( b > $o ) > b ).
thf(decl_25,type,
epred2_1: ( ( b > $o ) > b ) > b > $o ).
thf(decl_26,type,
esk3_1: ( ( b > $o ) > b ) > b ).
thf(cX5310_SUB4,conjecture,
( ! [X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
? [X3: b] :
( ? [X4: b] : ( X2 @ X4 )
=> ( X2 @ X3 ) )
=> ? [X5: ( b > $o ) > b] :
! [X2: b > $o] :
( ? [X4: b] : ( X2 @ X4 )
=> ( X2 @ ( X5 @ X2 ) ) ) )
=> ? [X6: ( b > $o ) > b] :
! [X7: b > $o] :
( ? [X8: b] : ( X7 @ X8 )
=> ( X7 @ ( X6 @ X7 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5310_SUB4) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
? [X3: b] :
( ? [X4: b] : ( X2 @ X4 )
=> ( X2 @ X3 ) )
=> ? [X5: ( b > $o ) > b] :
! [X2: b > $o] :
( ? [X4: b] : ( X2 @ X4 )
=> ( X2 @ ( X5 @ X2 ) ) ) )
=> ? [X6: ( b > $o ) > b] :
! [X7: b > $o] :
( ? [X8: b] : ( X7 @ X8 )
=> ( X7 @ ( X6 @ X7 ) ) ) ),
inference(assume_negation,[status(cth)],[cX5310_SUB4]) ).
thf(c_0_2,negated_conjecture,
! [X20: b,X23: b > $o,X24: b,X25: ( b > $o ) > b] :
( ( ( epred1_0 @ ( esk1_1 @ X20 ) )
| ~ ( X23 @ X24 )
| ( X23 @ ( esk2_0 @ X23 ) ) )
& ( ~ ( epred1_0 @ X20 )
| ~ ( X23 @ X24 )
| ( X23 @ ( esk2_0 @ X23 ) ) )
& ( epred2_1 @ X25 @ ( esk3_1 @ X25 ) )
& ~ ( epred2_1 @ X25 @ ( X25 @ ( epred2_1 @ X25 ) ) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: b > $o,X3: b,X4: b] :
( ( epred1_0 @ ( esk1_1 @ X3 ) )
| ( X2 @ ( esk2_0 @ X2 ) )
| ~ ( X2 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: b > $o,X3: b,X4: b] :
( ( X2 @ ( esk2_0 @ X2 ) )
| ~ ( epred1_0 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: b > $o,X3: b] :
( ( X2 @ ( esk2_0 @ X2 ) )
| ~ ( X2 @ X3 ) ),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X5: ( b > $o ) > b] : ( epred2_1 @ X5 @ ( esk3_1 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X5: ( b > $o ) > b] :
~ ( epred2_1 @ X5 @ ( X5 @ ( epred2_1 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X5: ( b > $o ) > b] : ( epred2_1 @ X5 @ ( esk2_0 @ ( epred2_1 @ X5 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL733^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 02:19:08 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.51 Running higher-order theorem proving
% 0.22/0.51 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.22/0.52 # Version: 3.1.0-ho
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.22/0.52 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting sh2lt with 1200s (4) cores
% 0.22/0.52 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.52 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.52 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.52 # Starting ehoh_best3_rw with 300s (1) cores
% 0.22/0.52 # full_lambda_6 with pid 12891 completed with status 0
% 0.22/0.52 # Result found by full_lambda_6
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.22/0.52 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting sh2lt with 1200s (4) cores
% 0.22/0.52 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.52 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.22/0.52 # Search class: HGUNF-FFSF11-SHHFFMBN
% 0.22/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting ho_unfolding_3 with 163s (1) cores
% 0.22/0.52 # ho_unfolding_3 with pid 12897 completed with status 0
% 0.22/0.52 # Result found by ho_unfolding_3
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.22/0.52 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting sh2lt with 1200s (4) cores
% 0.22/0.52 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.52 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.22/0.52 # Search class: HGUNF-FFSF11-SHHFFMBN
% 0.22/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting ho_unfolding_3 with 163s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 2
% 0.22/0.52 # Removed by relevancy pruning/SinE : 1
% 0.22/0.52 # Initial clauses : 4
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 4
% 0.22/0.52 # Processed clauses : 8
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 8
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 1
% 0.22/0.52 # Backward-rewritten : 0
% 0.22/0.52 # Generated clauses : 4
% 0.22/0.52 # ...of the previous two non-redundant : 2
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 1
% 0.22/0.52 # Paramodulations : 3
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 1
% 0.22/0.52 # ...of those cached : 0
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 4
% 0.22/0.52 # Positive orientable unit clauses : 2
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 1
% 0.22/0.52 # Non-unit-clauses : 1
% 0.22/0.52 # Current number of unprocessed clauses: 1
% 0.22/0.52 # ...number of literals in the above : 1
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 4
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 3
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 3
% 0.22/0.52 # Non-unit clause-clause subsumptions : 2
% 0.22/0.52 # Unit Clause-clause subsumption calls : 0
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 0
% 0.22/0.52 # BW rewrite match successes : 0
% 0.22/0.52 # Condensation attempts : 8
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 596
% 0.22/0.52 # Search garbage collected termcells : 202
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.002 s
% 0.22/0.52 # System time : 0.002 s
% 0.22/0.52 # Total time : 0.004 s
% 0.22/0.52 # Maximum resident set size: 1808 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.003 s
% 0.22/0.52 # System time : 0.005 s
% 0.22/0.52 # Total time : 0.008 s
% 0.22/0.52 # Maximum resident set size: 1724 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------