TSTP Solution File: LCL727^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : LCL727^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 Jun 24 10:51:56 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 66 ( 6 ~; 3 |; 3 &; 44 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 26 ( 0 ^ 18 !; 8 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_1: ( ( a > $o ) > a > $o ) > ( a > $o ) > a ).
thf(decl_23,type,
epred1_0: ( a > $o ) > $o ).
thf(decl_24,type,
esk2_1: ( a > $o ) > a ).
thf(decl_25,type,
epred2_1: ( ( a > $o ) > a ) > a > $o ).
thf(cTHM533,conjecture,
( ! [X1: ( a > $o ) > a > $o] :
? [X2: ( a > $o ) > a] :
! [X3: a > $o] :
( ? [X4: a] : ( X1 @ X3 @ X4 )
=> ( X1 @ X3 @ ( X2 @ X3 ) ) )
=> ! [X5: ( a > $o ) > $o] :
( ! [X6: a > $o] :
( ( X5 @ X6 )
=> ? [X7: a] : ( X6 @ X7 ) )
=> ? [X8: ( a > $o ) > a] :
! [X6: a > $o] :
( ( X5 @ X6 )
=> ( X6 @ ( X8 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Y9H5nbo278/E---3.1_7327.p',cTHM533) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: ( a > $o ) > a > $o] :
? [X2: ( a > $o ) > a] :
! [X3: a > $o] :
( ? [X4: a] : ( X1 @ X3 @ X4 )
=> ( X1 @ X3 @ ( X2 @ X3 ) ) )
=> ! [X5: ( a > $o ) > $o] :
( ! [X6: a > $o] :
( ( X5 @ X6 )
=> ? [X7: a] : ( X6 @ X7 ) )
=> ? [X8: ( a > $o ) > a] :
! [X6: a > $o] :
( ( X5 @ X6 )
=> ( X6 @ ( X8 @ X6 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM533]) ).
thf(c_0_2,negated_conjecture,
! [X18: ( a > $o ) > a > $o,X20: a > $o,X21: a,X23: a > $o,X25: ( a > $o ) > a] :
( ( ~ ( X18 @ X20 @ X21 )
| ( X18 @ X20 @ ( esk1_1 @ X18 @ X20 ) ) )
& ( ~ ( epred1_0 @ X23 )
| ( X23 @ ( esk2_1 @ X23 ) ) )
& ( epred1_0 @ ( epred2_1 @ X25 ) )
& ~ ( epred2_1 @ X25 @ ( X25 @ ( epred2_1 @ X25 ) ) ) ),
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_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: ( a > $o ) > a] :
~ ( epred2_1 @ X2 @ ( X2 @ ( epred2_1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: a > $o] :
( ( X3 @ ( esk2_1 @ X3 ) )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: ( a > $o ) > a] : ( epred1_0 @ ( epred2_1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL727^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Jun 22 14:44:39 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Y9H5nbo278/E---3.1_7327.p
% 0.21/0.49 # Version: 3.2.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 # full_lambda_6 with pid 7410 completed with status 0
% 0.21/0.49 # Result found by full_lambda_6
% 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 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.21/0.49 # Search class: HHUNF-FFSF11-SHHFFMBN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10 with 135s (1) cores
% 0.21/0.49 # new_ho_10 with pid 7414 completed with status 0
% 0.21/0.49 # Result found by new_ho_10
% 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 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.21/0.49 # Search class: HHUNF-FFSF11-SHHFFMBN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10 with 135s (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 : 7
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 7
% 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 : 0
% 0.21/0.49 # Generated clauses : 1
% 0.21/0.49 # ...of the previous two non-redundant : 0
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 1
% 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 : 1
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 1
% 0.21/0.49 # Current number of unprocessed clauses: 1
% 0.21/0.49 # ...number of literals in the above : 2
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 4
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 0
% 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 : 0
% 0.21/0.49 # BW rewrite match successes : 0
% 0.21/0.49 # Condensation attempts : 7
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 456
% 0.21/0.49 # Search garbage collected termcells : 187
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.001 s
% 0.21/0.49 # System time : 0.004 s
% 0.21/0.49 # Total time : 0.004 s
% 0.21/0.49 # Maximum resident set size: 1756 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.003 s
% 0.21/0.49 # System time : 0.005 s
% 0.21/0.49 # Total time : 0.008 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
%------------------------------------------------------------------------------