TSTP Solution File: NUN025^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUN025^2 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Tue May 21 02:15:23 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 6 unt; 4 typ; 0 def)
% Number of atoms : 51 ( 42 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 164 ( 20 ~; 13 |; 16 &; 109 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 36 ( 0 ^ 34 !; 2 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
zero: $i ).
thf(decl_23,type,
s: $i > $i ).
thf(decl_24,type,
ite: $o > $i > $i > $i ).
thf(decl_25,type,
h: $i > $i ).
thf(n10,conjecture,
( ( ! [X1: $o,X2: $i,X3: $i] :
( X1
=> ( ( ite @ X1 @ X2 @ X3 )
= X2 ) )
& ! [X1: $o,X2: $i,X3: $i] :
( ~ X1
=> ( ( ite @ X1 @ X2 @ X3 )
= X3 ) )
& ! [X4: $i] :
( ( s @ X4 )
!= X4 )
& ! [X4: $i] :
( ( h @ X4 )
= ( ite
@ ( X4
= ( s @ zero ) )
@ zero
@ ( s @ zero ) ) ) )
=> ? [X5: $i > $i] :
( ( ( X5 @ zero )
= ( s @ zero ) )
& ( ( X5 @ ( s @ zero ) )
= zero )
& ( ( X5 @ ( s @ ( s @ zero ) ) )
= ( s @ zero ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n10) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $o,X2: $i,X3: $i] :
( X1
=> ( ( ite @ X1 @ X2 @ X3 )
= X2 ) )
& ! [X1: $o,X2: $i,X3: $i] :
( ~ X1
=> ( ( ite @ X1 @ X2 @ X3 )
= X3 ) )
& ! [X4: $i] :
( ( s @ X4 )
!= X4 )
& ! [X4: $i] :
( ( ( X4
!= ( s @ zero ) )
| ( ( h @ X4 )
= ( ite @ $true @ zero @ ( s @ zero ) ) ) )
& ( ( X4
= ( s @ zero ) )
| ( ( h @ X4 )
= ( ite @ $false @ zero @ ( s @ zero ) ) ) ) ) )
=> ? [X5: $i > $i] :
( ( ( X5 @ zero )
= ( s @ zero ) )
& ( ( X5 @ ( s @ zero ) )
= zero )
& ( ( X5 @ ( s @ ( s @ zero ) ) )
= ( s @ zero ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[n10])])]) ).
thf(c_0_2,negated_conjecture,
! [X15: $o,X16: $i,X17: $i,X18: $o,X19: $i,X20: $i,X21: $i,X22: $i,X23: $i > $i] :
( ( ~ X15
| ( ( ite @ X15 @ X16 @ X17 )
= X16 ) )
& ( X18
| ( ( ite @ X18 @ X19 @ X20 )
= X20 ) )
& ( ( s @ X21 )
!= X21 )
& ( ( X22
!= ( s @ zero ) )
| ( ( h @ X22 )
= ( ite @ $true @ zero @ ( s @ zero ) ) ) )
& ( ( X22
= ( s @ zero ) )
| ( ( h @ X22 )
= ( ite @ $false @ zero @ ( s @ zero ) ) ) )
& ( ( ( X23 @ zero )
!= ( s @ zero ) )
| ( ( X23 @ ( s @ zero ) )
!= zero )
| ( ( X23 @ ( s @ ( s @ zero ) ) )
!= ( s @ zero ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: $i] :
( ( X2
= ( s @ zero ) )
| ( ( h @ X2 )
= ( ite @ ~ $true @ zero @ ( s @ zero ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i,X3: $i] :
( ( ite @ ~ $true @ X2 @ X3 )
= X3 ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2])])]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i] :
( ( ( h @ X2 )
= ( ite @ $true @ zero @ ( s @ zero ) ) )
| ( X2
!= ( s @ zero ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i,X2: $i] :
( ( ite @ $true @ X2 @ X3 )
= X2 ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2])])]) ).
thf(c_0_7,negated_conjecture,
! [X5: $i > $i] :
( ( ( X5 @ zero )
!= ( s @ zero ) )
| ( ( X5 @ ( s @ zero ) )
!= zero )
| ( ( X5 @ ( s @ ( s @ zero ) ) )
!= ( s @ zero ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i] :
( ( ( h @ X2 )
= ( s @ zero ) )
| ( X2
= ( s @ zero ) ) ),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_9,negated_conjecture,
( ( h @ ( s @ zero ) )
= zero ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i] :
( ( s @ X2 )
!= X2 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
( ( h @ zero )
!= ( s @ zero ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_8]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN025^2 : TPTP v8.2.0. Released v6.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 15:05:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.49 # new_bool_9 with pid 32180 completed with status 0
% 0.20/0.49 # Result found by new_bool_9
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.49 # Search class: HGHPS-FFSF31-MSSFFSNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # new_ho_10 with pid 32188 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.49 # Search class: HGHPS-FFSF31-MSSFFSNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 5
% 0.20/0.49 # Removed by relevancy pruning/SinE : 4
% 0.20/0.49 # Initial clauses : 6
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 6
% 0.20/0.49 # Processed clauses : 16
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 1
% 0.20/0.49 # ...remaining for further processing : 15
% 0.20/0.49 # Other redundant clauses eliminated : 2
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 6
% 0.20/0.49 # ...of the previous two non-redundant : 5
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 4
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 2
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 7
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 7
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 2
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 2
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 7
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 2
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 16
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 828
% 0.20/0.49 # Search garbage collected termcells : 230
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1800 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1716 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------