TSTP Solution File: NUM660^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM660^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:22 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 19 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 24 ( 8 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 51 ( 11 ~; 4 |; 1 &; 30 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 0 ^ 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
more: nat > nat > $o ).
thf(decl_25,type,
less: nat > nat > $o ).
thf(m,axiom,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(satz13,conjecture,
( ~ ( less @ y @ x )
=> ( y = x ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz13) ).
thf(satz11,axiom,
! [X1: nat,X2: nat] :
( ( more @ X1 @ X2 )
=> ( less @ X2 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz11) ).
thf(c_0_3,plain,
( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(fof_simplification,[status(thm)],[m]) ).
thf(c_0_4,negated_conjecture,
~ ( ~ ( less @ y @ x )
=> ( y = x ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz13])]) ).
thf(c_0_5,plain,
( ( more @ x @ y )
| ( x = y ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ~ ( less @ y @ x )
& ( y != x ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
thf(c_0_7,plain,
! [X5: nat,X6: nat] :
( ~ ( more @ X5 @ X6 )
| ( less @ X6 @ X5 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz11])])]) ).
thf(c_0_8,plain,
( ( more @ x @ y )
| ( x = y ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
y != x,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( less @ y @ x ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
! [X1: nat,X2: nat] :
( ( less @ X2 @ X1 )
| ~ ( more @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
more @ x @ y,
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM660^1 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n005.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 05:54:53 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.52 Running higher-order theorem proving
% 0.22/0.52 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.53 # Version: 3.1.0-ho
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.53 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.53 # Starting sh4l with 300s (1) cores
% 0.22/0.53 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.53 # ho_unfolding_6 with pid 19765 completed with status 0
% 0.22/0.53 # Result found by ho_unfolding_6
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.53 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGUSF-FFSF00-SFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.53 # new_ho_10 with pid 19768 completed with status 0
% 0.22/0.53 # Result found by new_ho_10
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.53 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGUSF-FFSF00-SFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 8
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 9
% 0.22/0.53 # Removed in clause preprocessing : 5
% 0.22/0.53 # Initial clauses in saturation : 4
% 0.22/0.53 # Processed clauses : 8
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 8
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 0
% 0.22/0.53 # Generated clauses : 1
% 0.22/0.53 # ...of the previous two non-redundant : 0
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 1
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 1
% 0.22/0.53 # ...of those cached : 0
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 4
% 0.22/0.53 # Positive orientable unit clauses : 1
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 2
% 0.22/0.53 # Non-unit-clauses : 1
% 0.22/0.53 # Current number of unprocessed clauses: 0
% 0.22/0.53 # ...number of literals in the above : 0
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 4
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 0
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 0
% 0.22/0.53 # BW rewrite match successes : 0
% 0.22/0.53 # Condensation attempts : 8
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 263
% 0.22/0.53 # Search garbage collected termcells : 29
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.004 s
% 0.22/0.53 # System time : 0.001 s
% 0.22/0.53 # Total time : 0.005 s
% 0.22/0.53 # Maximum resident set size: 1572 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.005 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.008 s
% 0.22/0.53 # Maximum resident set size: 1712 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------