TSTP Solution File: NUM681^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM681^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 01:15:31 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 35 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 61 ( 18 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 198 ( 41 ~; 15 |; 2 &; 124 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 ^ 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
z: nat ).
thf(decl_25,type,
pl: nat > nat > nat ).
thf(decl_26,type,
less: nat > nat > $o ).
thf(decl_27,type,
more: nat > nat > $o ).
thf(satz10b,axiom,
! [X2: nat,X3: nat] :
~ ( ( ( X2 = X3 )
=> ~ ( more @ X2 @ X3 ) )
=> ~ ~ ( ( ( more @ X2 @ X3 )
=> ~ ( less @ X2 @ X3 ) )
=> ~ ( ( less @ X2 @ X3 )
=> ( X2 != X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10b) ).
thf(satz19a,axiom,
! [X2: nat,X3: nat,X4: nat] :
( ( more @ X2 @ X3 )
=> ( more @ ( pl @ X2 @ X4 ) @ ( pl @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19a) ).
thf(satz19c,axiom,
! [X2: nat,X3: nat,X4: nat] :
( ( less @ X2 @ X3 )
=> ( less @ ( pl @ X2 @ X4 ) @ ( pl @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19c) ).
thf(i,axiom,
( ( pl @ x @ z )
= ( pl @ y @ z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i) ).
thf(satz10a,axiom,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ ( more @ X2 @ X3 )
=> ( less @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10a) ).
thf(satz20b,conjecture,
x = y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz20b) ).
thf(c_0_6,plain,
! [X2: nat,X3: nat] :
~ ( ( ( X2 = X3 )
=> ~ ( more @ X2 @ X3 ) )
=> ~ ~ ( ( ( more @ X2 @ X3 )
=> ~ ( less @ X2 @ X3 ) )
=> ~ ( ( less @ X2 @ X3 )
=> ( X2 != X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[satz10b]) ).
thf(c_0_7,plain,
! [X16: nat,X17: nat] :
( ( ( X16 != X17 )
| ~ ( more @ X16 @ X17 ) )
& ( ~ ( more @ X16 @ X17 )
| ~ ( less @ X16 @ X17 ) )
& ( ~ ( less @ X16 @ X17 )
| ( X16 != X17 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
thf(c_0_8,plain,
! [X23: nat,X24: nat,X25: nat] :
( ~ ( more @ X23 @ X24 )
| ( more @ ( pl @ X23 @ X25 ) @ ( pl @ X24 @ X25 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19a])])]) ).
thf(c_0_9,plain,
! [X18: nat,X19: nat,X20: nat] :
( ~ ( less @ X18 @ X19 )
| ( less @ ( pl @ X18 @ X20 ) @ ( pl @ X19 @ X20 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19c])])]) ).
thf(c_0_10,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
| ~ ( more @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X2: nat,X4: nat,X3: nat] :
( ( more @ ( pl @ X2 @ X4 ) @ ( pl @ X3 @ X4 ) )
| ~ ( more @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
( ( pl @ x @ z )
= ( pl @ y @ z ) ),
inference(split_conjunct,[status(thm)],[i]) ).
thf(c_0_13,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ ( more @ X2 @ X3 )
=> ( less @ X2 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[satz10a]) ).
thf(c_0_14,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz20b])]) ).
thf(c_0_15,plain,
! [X2: nat,X3: nat] :
( ~ ( less @ X2 @ X3 )
| ( X2 != X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_16,plain,
! [X2: nat,X4: nat,X3: nat] :
( ( less @ ( pl @ X2 @ X4 ) @ ( pl @ X3 @ X4 ) )
| ~ ( less @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_17,plain,
! [X2: nat] :
~ ( more @ X2 @ X2 ),
inference(er,[status(thm)],[c_0_10]) ).
thf(c_0_18,plain,
! [X2: nat] :
( ( more @ ( pl @ X2 @ z ) @ ( pl @ x @ z ) )
| ~ ( more @ X2 @ y ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_19,plain,
! [X21: nat,X22: nat] :
( ( X21 = X22 )
| ( more @ X21 @ X22 )
| ( less @ X21 @ X22 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
thf(c_0_20,negated_conjecture,
x != y,
inference(fof_nnf,[status(thm)],[c_0_14]) ).
thf(c_0_21,plain,
! [X2: nat] :
~ ( less @ X2 @ X2 ),
inference(er,[status(thm)],[c_0_15]) ).
thf(c_0_22,plain,
! [X2: nat] :
( ( less @ ( pl @ X2 @ z ) @ ( pl @ x @ z ) )
| ~ ( less @ X2 @ y ) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
thf(c_0_23,plain,
~ ( more @ x @ y ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_24,plain,
! [X2: nat,X3: nat] :
( ( X2 = X3 )
| ( more @ X2 @ X3 )
| ( less @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_25,negated_conjecture,
x != y,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,plain,
~ ( less @ x @ y ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM681^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 06:14:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_5 with 300s (1) cores
% 0.21/0.51 # Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.51 # full_lambda_5 with pid 24628 completed with status 0
% 0.21/0.51 # Result found by full_lambda_5
% 0.21/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_5 with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHSF-FFSF22-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # new_ho_10 with pid 24632 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_5 with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHSF-FFSF22-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 14
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 16
% 0.21/0.51 # Removed in clause preprocessing : 8
% 0.21/0.51 # Initial clauses in saturation : 8
% 0.21/0.51 # Processed clauses : 30
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 4
% 0.21/0.51 # ...remaining for further processing : 26
% 0.21/0.51 # Other redundant clauses eliminated : 2
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 26
% 0.21/0.51 # ...of the previous two non-redundant : 24
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 24
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 2
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 0
% 0.21/0.51 # ...of those cached : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 16
% 0.21/0.51 # Positive orientable unit clauses : 1
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 6
% 0.21/0.51 # Non-unit-clauses : 9
% 0.21/0.51 # Current number of unprocessed clauses: 10
% 0.21/0.51 # ...number of literals in the above : 17
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 8
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 10
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 9
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 5
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 30
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 1038
% 0.21/0.51 # Search garbage collected termcells : 157
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.003 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.007 s
% 0.21/0.51 # Maximum resident set size: 1744 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.005 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.010 s
% 0.21/0.51 # Maximum resident set size: 1720 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------