TSTP Solution File: NUM689^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM689^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:36 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 28 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 44 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 135 ( 10 ~; 6 |; 0 &; 114 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 33 ( 11 ^ 22 !; 0 ?; 33 :)
% 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,
some: ( nat > $o ) > $o ).
thf(decl_28,type,
diffprop: nat > nat > nat > $o ).
thf(decl_29,type,
pl: nat > nat > nat ).
thf(decl_30,type,
moreis: nat > nat > $o ).
thf(satz22c,conjecture,
( some
@ ^ [X1: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22c) ).
thf(satz22a,axiom,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( ( moreis @ X2 @ X3 )
=> ( ( some
@ ^ [X6: nat] : ( diffprop @ X4 @ X5 @ X6 ) )
=> ( some
@ ^ [X6: nat] : ( diffprop @ ( pl @ X2 @ X4 ) @ ( pl @ X3 @ X5 ) @ X6 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22a) ).
thf(k,axiom,
( some
@ ^ [X1: nat] : ( diffprop @ u @ z @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(satz14,axiom,
! [X2: nat,X3: nat] :
( ( lessis @ X2 @ X3 )
=> ( moreis @ X3 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz14) ).
thf(l,axiom,
lessis @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(c_0_5,negated_conjecture,
~ ( some
@ ^ [Z0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ Z0 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz22c])])]) ).
thf(c_0_6,plain,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( ( moreis @ X2 @ X3 )
=> ( ( some
@ ^ [Z0: nat] : ( diffprop @ X4 @ X5 @ Z0 ) )
=> ( some
@ ^ [Z0: nat] : ( diffprop @ ( pl @ X2 @ X4 ) @ ( pl @ X3 @ X5 ) @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[satz22a]) ).
thf(c_0_7,negated_conjecture,
~ ( some
@ ^ [Z0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ Z0 ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X13: nat,X14: nat,X15: nat,X16: nat] :
( ~ ( moreis @ X13 @ X14 )
| ~ ( some
@ ^ [Z0: nat] : ( diffprop @ X15 @ X16 @ Z0 ) )
| ( some
@ ^ [Z0: nat] : ( diffprop @ ( pl @ X13 @ X15 ) @ ( pl @ X14 @ X16 ) @ Z0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
thf(c_0_9,plain,
( some
@ ^ [Z0: nat] : ( diffprop @ u @ z @ Z0 ) ),
inference(fof_simplification,[status(thm)],[k]) ).
thf(c_0_10,negated_conjecture,
~ ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( some @ ( diffprop @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X4 ) ) )
| ~ ( moreis @ X1 @ X2 )
| ~ ( some @ ( diffprop @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
some @ ( diffprop @ u @ z ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
! [X17: nat,X18: nat] :
( ~ ( lessis @ X17 @ X18 )
| ( moreis @ X18 @ X17 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz14])])]) ).
thf(c_0_14,negated_conjecture,
~ ( moreis @ y @ x ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
thf(c_0_15,plain,
! [X1: nat,X2: nat] :
( ( moreis @ X2 @ X1 )
| ~ ( lessis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,plain,
lessis @ x @ y,
inference(split_conjunct,[status(thm)],[l]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : NUM689^1 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n013.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 05:45:22 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.39 Running higher-order theorem proving
% 0.15/0.40 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.15/0.40 # Version: 3.1.0-ho
% 0.15/0.40 # Preprocessing class: HSMSSMSSSSMNSSN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.15/0.40 # Starting lpo1_def_fix with 300s (1) cores
% 0.15/0.40 # sh5l with pid 22571 completed with status 0
% 0.15/0.40 # Result found by sh5l
% 0.15/0.40 # Preprocessing class: HSMSSMSSSSMNSSN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.40 # Search class: HHUNF-FFSF22-SSSFFFNN
% 0.15/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting new_ho_10 with 181s (1) cores
% 0.15/0.40 # new_ho_10 with pid 22578 completed with status 0
% 0.15/0.40 # Result found by new_ho_10
% 0.15/0.40 # Preprocessing class: HSMSSMSSSSMNSSN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.40 # Search class: HHUNF-FFSF22-SSSFFFNN
% 0.15/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting new_ho_10 with 181s (1) cores
% 0.15/0.40 # Preprocessing time : 0.001 s
% 0.15/0.40 # Presaturation interreduction done
% 0.15/0.40
% 0.15/0.40 # Proof found!
% 0.15/0.40 # SZS status Theorem
% 0.15/0.40 # SZS output start CNFRefutation
% See solution above
% 0.15/0.40 # Parsed axioms : 15
% 0.15/0.40 # Removed by relevancy pruning/SinE : 10
% 0.15/0.40 # Initial clauses : 5
% 0.15/0.40 # Removed in clause preprocessing : 0
% 0.15/0.40 # Initial clauses in saturation : 5
% 0.15/0.40 # Processed clauses : 11
% 0.15/0.40 # ...of these trivial : 0
% 0.15/0.40 # ...subsumed : 0
% 0.15/0.40 # ...remaining for further processing : 11
% 0.15/0.40 # Other redundant clauses eliminated : 0
% 0.15/0.40 # Clauses deleted for lack of memory : 0
% 0.15/0.40 # Backward-subsumed : 0
% 0.15/0.40 # Backward-rewritten : 0
% 0.15/0.40 # Generated clauses : 2
% 0.15/0.40 # ...of the previous two non-redundant : 1
% 0.15/0.40 # ...aggressively subsumed : 0
% 0.15/0.40 # Contextual simplify-reflections : 0
% 0.15/0.40 # Paramodulations : 2
% 0.15/0.40 # Factorizations : 0
% 0.15/0.40 # NegExts : 0
% 0.15/0.40 # Equation resolutions : 0
% 0.15/0.40 # Disequality decompositions : 0
% 0.15/0.40 # Total rewrite steps : 2
% 0.15/0.40 # ...of those cached : 0
% 0.15/0.40 # Propositional unsat checks : 0
% 0.15/0.40 # Propositional check models : 0
% 0.15/0.40 # Propositional check unsatisfiable : 0
% 0.15/0.40 # Propositional clauses : 0
% 0.15/0.40 # Propositional clauses after purity: 0
% 0.15/0.40 # Propositional unsat core size : 0
% 0.15/0.40 # Propositional preprocessing time : 0.000
% 0.15/0.40 # Propositional encoding time : 0.000
% 0.15/0.40 # Propositional solver time : 0.000
% 0.15/0.40 # Success case prop preproc time : 0.000
% 0.15/0.40 # Success case prop encoding time : 0.000
% 0.15/0.40 # Success case prop solver time : 0.000
% 0.15/0.40 # Current number of processed clauses : 6
% 0.15/0.40 # Positive orientable unit clauses : 2
% 0.15/0.40 # Positive unorientable unit clauses: 0
% 0.15/0.40 # Negative unit clauses : 2
% 0.15/0.40 # Non-unit-clauses : 2
% 0.15/0.40 # Current number of unprocessed clauses: 0
% 0.15/0.40 # ...number of literals in the above : 0
% 0.15/0.40 # Current number of archived formulas : 0
% 0.15/0.40 # Current number of archived clauses : 5
% 0.15/0.40 # Clause-clause subsumption calls (NU) : 2
% 0.15/0.40 # Rec. Clause-clause subsumption calls : 2
% 0.15/0.40 # Non-unit clause-clause subsumptions : 0
% 0.15/0.40 # Unit Clause-clause subsumption calls : 1
% 0.15/0.40 # Rewrite failures with RHS unbound : 0
% 0.15/0.40 # BW rewrite match attempts : 0
% 0.15/0.40 # BW rewrite match successes : 0
% 0.15/0.40 # Condensation attempts : 11
% 0.15/0.40 # Condensation successes : 0
% 0.15/0.40 # Termbank termtop insertions : 492
% 0.15/0.40 # Search garbage collected termcells : 87
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.003 s
% 0.15/0.40 # System time : 0.001 s
% 0.15/0.40 # Total time : 0.004 s
% 0.15/0.40 # Maximum resident set size: 1788 pages
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.003 s
% 0.15/0.40 # System time : 0.004 s
% 0.15/0.40 # Total time : 0.007 s
% 0.15/0.40 # Maximum resident set size: 1724 pages
% 0.15/0.40 % E---3.1 exiting
% 0.15/0.41 % E exiting
%------------------------------------------------------------------------------