TSTP Solution File: NUM692^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM692^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:37 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 36 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 133 ( 16 ~; 11 |; 0 &; 102 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 0 ^ 28 !; 0 ?; 28 :)
% 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,
u: nat ).
thf(decl_26,type,
lessis: nat > nat > $o ).
thf(decl_27,type,
ts: nat > nat > nat ).
thf(decl_28,type,
moreis: nat > nat > $o ).
thf(satz23a,conjecture,
lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz23a) ).
thf(satz13,axiom,
! [X1: nat,X2: nat] :
( ( moreis @ X1 @ X2 )
=> ( lessis @ X2 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz13) ).
thf(satz23,axiom,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( moreis @ X1 @ X2 )
=> ( ( moreis @ X3 @ X4 )
=> ( moreis @ ( ts @ X1 @ X3 ) @ ( ts @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz23) ).
thf(satz14,axiom,
! [X1: nat,X2: nat] :
( ( lessis @ X1 @ X2 )
=> ( moreis @ X2 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz14) ).
thf(k,axiom,
lessis @ z @ u,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(l,axiom,
lessis @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(c_0_6,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz23a])]) ).
thf(c_0_7,plain,
! [X13: nat,X14: nat] :
( ~ ( moreis @ X13 @ X14 )
| ( lessis @ X14 @ X13 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz13])])]) ).
thf(c_0_8,plain,
! [X15: nat,X16: nat,X17: nat,X18: nat] :
( ~ ( moreis @ X15 @ X16 )
| ~ ( moreis @ X17 @ X18 )
| ( moreis @ ( ts @ X15 @ X17 ) @ ( ts @ X16 @ X18 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz23])])]) ).
thf(c_0_9,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: nat,X2: nat] :
( ( lessis @ X2 @ X1 )
| ~ ( moreis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( moreis @ ( ts @ X1 @ X3 ) @ ( ts @ X2 @ X4 ) )
| ~ ( moreis @ X1 @ X2 )
| ~ ( moreis @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
! [X4: nat,X3: nat,X2: nat,X1: nat] :
( ( lessis @ ( ts @ X1 @ X2 ) @ ( ts @ X3 @ X4 ) )
| ~ ( moreis @ X4 @ X2 )
| ~ ( moreis @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,plain,
! [X19: nat,X20: nat] :
( ~ ( lessis @ X19 @ X20 )
| ( moreis @ X20 @ X19 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz14])])]) ).
thf(c_0_15,negated_conjecture,
( ~ ( moreis @ u @ z )
| ~ ( moreis @ y @ x ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,plain,
! [X1: nat,X2: nat] :
( ( moreis @ X2 @ X1 )
| ~ ( lessis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,plain,
lessis @ z @ u,
inference(split_conjunct,[status(thm)],[k]) ).
thf(c_0_18,negated_conjecture,
~ ( moreis @ y @ x ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
thf(c_0_19,plain,
lessis @ x @ y,
inference(split_conjunct,[status(thm)],[l]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM692^1 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 07:38:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.48 # Starting sh4l with 300s (1) cores
% 0.20/0.48 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.48 # new_ho_10 with pid 14849 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHUNF-FFSF22-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 901s (1) cores
% 0.20/0.48 # Starting sh5l with 151s (1) cores
% 0.20/0.48 # Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.20/0.48 # Starting lpo1_def_fix with 151s (1) cores
% 0.20/0.48 # Starting ehoh_best8_lambda with 146s (1) cores
% 0.20/0.48 # new_ho_10 with pid 14853 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHUNF-FFSF22-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 901s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 14
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 14
% 0.20/0.48 # Removed in clause preprocessing : 8
% 0.20/0.48 # Initial clauses in saturation : 6
% 0.20/0.48 # Processed clauses : 15
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 15
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 1
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 5
% 0.20/0.48 # ...of the previous two non-redundant : 3
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 5
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 2
% 0.20/0.48 # ...of those cached : 0
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 8
% 0.20/0.48 # Positive orientable unit clauses : 2
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 2
% 0.20/0.48 # Non-unit-clauses : 4
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 7
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 6
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 6
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 15
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 590
% 0.20/0.48 # Search garbage collected termcells : 75
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.002 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.006 s
% 0.20/0.48 # Maximum resident set size: 1736 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.009 s
% 0.20/0.48 # System time : 0.010 s
% 0.20/0.48 # Total time : 0.019 s
% 0.20/0.48 # Maximum resident set size: 1728 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------