TSTP Solution File: NUM673^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM673^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:29 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 20 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 17 ( 3 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 79 ( 6 ~; 2 |; 0 &; 70 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 0 ^ 15 !; 0 ?; 15 :)
% 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,
more: nat > nat > $o ).
thf(decl_26,type,
pl: nat > nat > nat ).
thf(satz19d,conjecture,
more @ ( pl @ z @ x ) @ ( pl @ z @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19d) ).
thf(satz6,axiom,
! [X1: nat,X2: nat] :
( ( pl @ X1 @ X2 )
= ( pl @ X2 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz6) ).
thf(satz19a,axiom,
! [X1: nat,X2: nat,X3: nat] :
( ( more @ X1 @ X2 )
=> ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19a) ).
thf(m,axiom,
more @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(c_0_4,negated_conjecture,
~ ( more @ ( pl @ z @ x ) @ ( pl @ z @ y ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz19d])]) ).
thf(c_0_5,negated_conjecture,
~ ( more @ ( pl @ z @ x ) @ ( pl @ z @ y ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
! [X12: nat,X13: nat] :
( ( pl @ X12 @ X13 )
= ( pl @ X13 @ X12 ) ),
inference(variable_rename,[status(thm)],[satz6]) ).
thf(c_0_7,negated_conjecture,
~ ( more @ ( pl @ z @ x ) @ ( pl @ z @ y ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X2: nat,X1: nat] :
( ( pl @ X1 @ X2 )
= ( pl @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X9: nat,X10: nat,X11: nat] :
( ~ ( more @ X9 @ X10 )
| ( more @ ( pl @ X9 @ X11 ) @ ( pl @ X10 @ X11 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19a])])]) ).
thf(c_0_10,negated_conjecture,
~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
thf(c_0_11,plain,
! [X1: nat,X3: nat,X2: nat] :
( ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X3 ) )
| ~ ( more @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
more @ x @ y,
inference(split_conjunct,[status(thm)],[m]) ).
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.03/0.12 % Problem : NUM673^1 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 07:10:23 EDT 2024
% 0.13/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.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 # sh4l with pid 22229 completed with status 0
% 0.20/0.48 # Result found by sh4l
% 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 # No SInE strategy applied
% 0.20/0.48 # Search class: HHUSF-FFSF22-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.48 # new_ho_10 with pid 22233 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 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.48 # Starting sh4l with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHUSF-FFSF22-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 163s (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 : 10
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 10
% 0.20/0.48 # Removed in clause preprocessing : 6
% 0.20/0.48 # Initial clauses in saturation : 4
% 0.20/0.48 # Processed clauses : 9
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 9
% 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 : 0
% 0.20/0.48 # Backward-rewritten : 1
% 0.20/0.48 # Generated clauses : 5
% 0.20/0.48 # ...of the previous two non-redundant : 1
% 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 : 3
% 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 : 4
% 0.20/0.48 # Positive orientable unit clauses : 1
% 0.20/0.48 # Positive unorientable unit clauses: 1
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 1
% 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 : 5
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 8
% 0.20/0.48 # BW rewrite match successes : 8
% 0.20/0.48 # Condensation attempts : 9
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 349
% 0.20/0.48 # Search garbage collected termcells : 32
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.005 s
% 0.20/0.48 # Maximum resident set size: 1608 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.008 s
% 0.20/0.48 # Maximum resident set size: 1720 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------