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