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