TSTP Solution File: NUM743^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM743^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:16:26 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 28 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 45 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 129 ( 18 ~; 16 |; 0 &; 88 @)
% ( 0 <=>; 7 =>; 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 : 27 ( 0 ^ 27 !; 0 ?; 27 :)
% 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,
lessf: frac > frac > $o ).
thf(decl_26,type,
eq: frac > frac > $o ).
thf(k,axiom,
( ~ ( lessf @ y @ z )
=> ( eq @ y @ z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).
thf(satz45,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ( lessf @ X2 @ X3 )
=> ( ( eq @ X2 @ X4 )
=> ( ( eq @ X3 @ X5 )
=> ( lessf @ X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz45) ).
thf(satz51b,conjecture,
lessf @ x @ z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz51b) ).
thf(satz37,axiom,
! [X2: frac] : ( eq @ X2 @ X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz37) ).
thf(satz50,axiom,
! [X2: frac,X3: frac,X4: frac] :
( ( lessf @ X2 @ X3 )
=> ( ( lessf @ X3 @ X4 )
=> ( lessf @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz50) ).
thf(l,axiom,
lessf @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(c_0_6,plain,
( ~ ( lessf @ y @ z )
=> ( eq @ y @ z ) ),
inference(fof_simplification,[status(thm)],[k]) ).
thf(c_0_7,plain,
! [X15: frac,X16: frac,X17: frac,X18: frac] :
( ~ ( lessf @ X15 @ X16 )
| ~ ( eq @ X15 @ X17 )
| ~ ( eq @ X16 @ X18 )
| ( lessf @ X17 @ X18 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz45])])]) ).
thf(c_0_8,plain,
( ( lessf @ y @ z )
| ( eq @ y @ z ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( lessf @ x @ z ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz51b])]) ).
thf(c_0_10,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ( lessf @ X4 @ X5 )
| ~ ( lessf @ X2 @ X3 )
| ~ ( eq @ X2 @ X4 )
| ~ ( eq @ X3 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( ( lessf @ y @ z )
| ( eq @ y @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X19: frac] : ( eq @ X19 @ X19 ),
inference(variable_rename,[status(thm)],[satz37]) ).
thf(c_0_13,plain,
! [X20: frac,X21: frac,X22: frac] :
( ~ ( lessf @ X20 @ X21 )
| ~ ( lessf @ X21 @ X22 )
| ( lessf @ X20 @ X22 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz50])])]) ).
thf(c_0_14,negated_conjecture,
~ ( lessf @ x @ z ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X3: frac,X2: frac] :
( ( lessf @ y @ z )
| ( lessf @ X2 @ z )
| ~ ( lessf @ X3 @ y )
| ~ ( eq @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_16,plain,
! [X2: frac] : ( eq @ X2 @ X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( lessf @ X2 @ X4 )
| ~ ( lessf @ X2 @ X3 )
| ~ ( lessf @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,negated_conjecture,
~ ( lessf @ x @ z ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,plain,
! [X2: frac] :
( ( lessf @ X2 @ z )
| ~ ( lessf @ X2 @ y ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_20,plain,
lessf @ x @ y,
inference(split_conjunct,[status(thm)],[l]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM743^1 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 20 06:11:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.22/0.51 Running higher-order theorem proving
% 0.22/0.51 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.22/0.53 # Version: 3.1.0-ho
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.53 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.53 # Starting sh4l with 300s (1) cores
% 0.22/0.53 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.53 # sh4l with pid 12644 completed with status 0
% 0.22/0.53 # Result found by sh4l
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.53 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.53 # Starting sh4l with 300s (1) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGUNF-FFSF00-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.53 # new_ho_10 with pid 12648 completed with status 0
% 0.22/0.53 # Result found by new_ho_10
% 0.22/0.53 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.53 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.53 # Starting sh4l with 300s (1) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGUNF-FFSF00-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 13
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 13
% 0.22/0.53 # Removed in clause preprocessing : 7
% 0.22/0.53 # Initial clauses in saturation : 6
% 0.22/0.53 # Processed clauses : 18
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 18
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 1
% 0.22/0.53 # Backward-rewritten : 0
% 0.22/0.53 # Generated clauses : 12
% 0.22/0.53 # ...of the previous two non-redundant : 8
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 1
% 0.22/0.53 # Paramodulations : 12
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 1
% 0.22/0.53 # ...of those cached : 0
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 11
% 0.22/0.53 # Positive orientable unit clauses : 2
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 1
% 0.22/0.53 # Non-unit-clauses : 8
% 0.22/0.53 # Current number of unprocessed clauses: 2
% 0.22/0.53 # ...number of literals in the above : 7
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 7
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 24
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 22
% 0.22/0.53 # Non-unit clause-clause subsumptions : 2
% 0.22/0.53 # Unit Clause-clause subsumption calls : 1
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 1
% 0.22/0.53 # BW rewrite match successes : 0
% 0.22/0.53 # Condensation attempts : 18
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 753
% 0.22/0.53 # Search garbage collected termcells : 92
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.005 s
% 0.22/0.53 # System time : 0.001 s
% 0.22/0.53 # Total time : 0.006 s
% 0.22/0.53 # Maximum resident set size: 1748 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.005 s
% 0.22/0.53 # System time : 0.004 s
% 0.22/0.53 # Total time : 0.009 s
% 0.22/0.53 # Maximum resident set size: 1724 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------