TSTP Solution File: NUM770^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM770^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:17:12 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 24 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 27 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 114 ( 11 ~; 8 |; 0 &; 92 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 0 ^ 21 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
frac: $tType ).
thf(decl_22,type,
x: frac ).
thf(decl_23,type,
y: frac ).
thf(decl_24,type,
v: frac ).
thf(decl_25,type,
moref: frac > frac > $o ).
thf(decl_26,type,
eq: frac > frac > $o ).
thf(decl_27,type,
pf: frac > frac > frac ).
thf(decl_28,type,
mf: frac > frac > frac ).
thf(satz67e,conjecture,
eq @ v @ ( mf @ x @ y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz67e) ).
thf(satz67b,axiom,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( eq @ ( pf @ X2 @ X3 ) @ X1 )
=> ( ( eq @ ( pf @ X2 @ X4 ) @ X1 )
=> ( eq @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz67b) ).
thf(satz67c,axiom,
! [X1: frac,X2: frac] :
( ( moref @ X1 @ X2 )
=> ( eq @ ( pf @ X2 @ ( mf @ X1 @ X2 ) ) @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz67c) ).
thf(e,axiom,
eq @ ( pf @ y @ v ) @ x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e) ).
thf(m,axiom,
moref @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(c_0_5,negated_conjecture,
~ ( eq @ v @ ( mf @ x @ y ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz67e])]) ).
thf(c_0_6,plain,
! [X11: frac,X12: frac,X13: frac,X14: frac] :
( ~ ( eq @ ( pf @ X12 @ X13 ) @ X11 )
| ~ ( eq @ ( pf @ X12 @ X14 ) @ X11 )
| ( eq @ X13 @ X14 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz67b])])]) ).
thf(c_0_7,plain,
! [X15: frac,X16: frac] :
( ~ ( moref @ X15 @ X16 )
| ( eq @ ( pf @ X16 @ ( mf @ X15 @ X16 ) ) @ X15 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz67c])])]) ).
thf(c_0_8,negated_conjecture,
~ ( eq @ v @ ( mf @ x @ y ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X1: frac,X2: frac,X4: frac,X3: frac] :
( ( eq @ X2 @ X4 )
| ~ ( eq @ ( pf @ X1 @ X2 ) @ X3 )
| ~ ( eq @ ( pf @ X1 @ X4 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: frac,X2: frac] :
( ( eq @ ( pf @ X2 @ ( mf @ X1 @ X2 ) ) @ X1 )
| ~ ( moref @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
~ ( eq @ v @ ( mf @ x @ y ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X1: frac,X2: frac,X3: frac] :
( ( eq @ X1 @ ( mf @ X2 @ X3 ) )
| ~ ( eq @ ( pf @ X3 @ X1 ) @ X2 )
| ~ ( moref @ X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
eq @ ( pf @ y @ v ) @ x,
inference(split_conjunct,[status(thm)],[e]) ).
thf(c_0_14,plain,
moref @ x @ y,
inference(split_conjunct,[status(thm)],[m]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM770^1 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 03:40:37 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running higher-order theorem proving
% 0.16/0.43 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.16/0.44 # Version: 3.1.0-ho
% 0.16/0.44 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44 # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.44 # Starting sh4l with 300s (1) cores
% 0.16/0.44 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.16/0.44 # ho_unfolding_6 with pid 12814 completed with status 0
% 0.16/0.44 # Result found by ho_unfolding_6
% 0.16/0.44 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44 # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HHUNF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44 # new_ho_10 with pid 12817 completed with status 0
% 0.16/0.44 # Result found by new_ho_10
% 0.16/0.44 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44 # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HHUNF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 13
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 13
% 0.16/0.44 # Removed in clause preprocessing : 8
% 0.16/0.44 # Initial clauses in saturation : 5
% 0.16/0.44 # Processed clauses : 14
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 14
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 6
% 0.16/0.44 # ...of the previous two non-redundant : 5
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 6
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 3
% 0.16/0.44 # ...of those cached : 1
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 9
% 0.16/0.44 # Positive orientable unit clauses : 4
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 4
% 0.16/0.44 # Current number of unprocessed clauses: 0
% 0.16/0.44 # ...number of literals in the above : 0
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 5
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 3
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 3
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 0
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 14
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 550
% 0.16/0.44 # Search garbage collected termcells : 62
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.003 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.004 s
% 0.16/0.44 # Maximum resident set size: 1580 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.005 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.007 s
% 0.16/0.44 # Maximum resident set size: 1720 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------