TSTP Solution File: NUM746^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM746^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:01 EDT 2024
% Result : Theorem 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 39 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 83 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 252 ( 38 ~; 27 |; 3 &; 164 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 39 ( 0 ^ 39 !; 0 ?; 39 :)
% 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(satz51b,axiom,
! [X2: frac,X3: frac,X4: frac] :
( ( lessf @ X2 @ X3 )
=> ( ( ~ ( lessf @ X3 @ X4 )
=> ( eq @ X3 @ X4 ) )
=> ( lessf @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz51b) ).
thf(k,axiom,
( ~ ( lessf @ y @ z )
=> ( eq @ y @ z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).
thf(satz52,conjecture,
( ~ ( lessf @ x @ z )
=> ( eq @ x @ z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz52) ).
thf(l,axiom,
( ~ ( lessf @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(satz39,axiom,
! [X2: frac,X3: frac,X4: frac] :
( ( eq @ X2 @ X3 )
=> ( ( eq @ X3 @ X4 )
=> ( eq @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz39) ).
thf(satz51a,axiom,
! [X2: frac,X3: frac,X4: frac] :
( ( ~ ( lessf @ X2 @ X3 )
=> ( eq @ X2 @ X3 ) )
=> ( ( lessf @ X3 @ X4 )
=> ( lessf @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz51a) ).
thf(c_0_6,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( lessf @ X2 @ X3 )
=> ( ( ~ ( lessf @ X3 @ X4 )
=> ( eq @ X3 @ X4 ) )
=> ( lessf @ X2 @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[satz51b]) ).
thf(c_0_7,plain,
( ~ ( lessf @ y @ z )
=> ( eq @ y @ z ) ),
inference(fof_simplification,[status(thm)],[k]) ).
thf(c_0_8,negated_conjecture,
~ ( ~ ( lessf @ x @ z )
=> ( eq @ x @ z ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz52])]) ).
thf(c_0_9,plain,
! [X17: frac,X18: frac,X19: frac] :
( ( ~ ( lessf @ X18 @ X19 )
| ( lessf @ X17 @ X19 )
| ~ ( lessf @ X17 @ X18 ) )
& ( ~ ( eq @ X18 @ X19 )
| ( lessf @ X17 @ X19 )
| ~ ( lessf @ X17 @ X18 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_10,plain,
( ( lessf @ y @ z )
| ( eq @ y @ z ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( ~ ( lessf @ x @ y )
=> ( eq @ x @ y ) ),
inference(fof_simplification,[status(thm)],[l]) ).
thf(c_0_12,negated_conjecture,
( ~ ( lessf @ x @ z )
& ~ ( eq @ x @ z ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
thf(c_0_13,plain,
! [X4: frac,X3: frac,X2: frac] :
( ( lessf @ X4 @ X3 )
| ~ ( eq @ X2 @ X3 )
| ~ ( lessf @ X4 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
( ( lessf @ y @ z )
| ( eq @ y @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
! [X4: frac,X3: frac,X2: frac] :
( ( lessf @ X4 @ X3 )
| ~ ( lessf @ X2 @ X3 )
| ~ ( lessf @ X4 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_16,plain,
! [X14: frac,X15: frac,X16: frac] :
( ~ ( eq @ X14 @ X15 )
| ~ ( eq @ X15 @ X16 )
| ( eq @ X14 @ X16 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz39])])]) ).
thf(c_0_17,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( ~ ( lessf @ X2 @ X3 )
=> ( eq @ X2 @ X3 ) )
=> ( ( lessf @ X3 @ X4 )
=> ( lessf @ X2 @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[satz51a]) ).
thf(c_0_18,plain,
( ( lessf @ x @ y )
| ( eq @ x @ y ) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
thf(c_0_19,negated_conjecture,
~ ( lessf @ x @ z ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_20,plain,
! [X2: frac] :
( ( lessf @ X2 @ z )
| ~ ( lessf @ X2 @ y ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_21,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( eq @ X2 @ X4 )
| ~ ( eq @ X2 @ X3 )
| ~ ( eq @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_22,plain,
! [X20: frac,X21: frac,X22: frac] :
( ( ~ ( lessf @ X20 @ X21 )
| ~ ( lessf @ X21 @ X22 )
| ( lessf @ X20 @ X22 ) )
& ( ~ ( eq @ X20 @ X21 )
| ~ ( lessf @ X21 @ X22 )
| ( lessf @ X20 @ X22 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
thf(c_0_23,plain,
( ( lessf @ x @ y )
| ( eq @ x @ y ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_24,negated_conjecture,
~ ( lessf @ x @ y ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_25,negated_conjecture,
~ ( eq @ x @ z ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_26,plain,
! [X2: frac] :
( ( lessf @ y @ z )
| ( eq @ X2 @ z )
| ~ ( eq @ X2 @ y ) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
thf(c_0_27,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( lessf @ X2 @ X4 )
| ~ ( eq @ X2 @ X3 )
| ~ ( lessf @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_28,plain,
eq @ x @ y,
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_29,negated_conjecture,
( ( lessf @ y @ z )
| ~ ( eq @ x @ y ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_30,plain,
! [X2: frac] :
( ( lessf @ x @ X2 )
| ~ ( lessf @ y @ X2 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_31,negated_conjecture,
lessf @ y @ z,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_28])]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM746^1 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n003.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon May 20 03:41:23 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.23/0.53 Running higher-order theorem proving
% 0.23/0.53 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.23/0.55 # Version: 3.1.0-ho
% 0.23/0.55 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # Starting full_lambda_5 with 300s (1) cores
% 0.23/0.55 # Starting new_ho_10_unif with 300s (1) cores
% 0.23/0.55 # new_bool_1 with pid 6176 completed with status 0
% 0.23/0.55 # Result found by new_bool_1
% 0.23/0.55 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 # Search class: HGUNF-FFSF00-SFFFFFNN
% 0.23/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 # Starting new_ho_10 with 181s (1) cores
% 0.23/0.55 # new_ho_10 with pid 6179 completed with status 0
% 0.23/0.55 # Result found by new_ho_10
% 0.23/0.55 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 # Search class: HGUNF-FFSF00-SFFFFFNN
% 0.23/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 # Starting new_ho_10 with 181s (1) cores
% 0.23/0.55 # Preprocessing time : 0.001 s
% 0.23/0.55 # Presaturation interreduction done
% 0.23/0.55
% 0.23/0.55 # Proof found!
% 0.23/0.55 # SZS status Theorem
% 0.23/0.55 # SZS output start CNFRefutation
% See solution above
% 0.23/0.55 # Parsed axioms : 13
% 0.23/0.55 # Removed by relevancy pruning/SinE : 7
% 0.23/0.55 # Initial clauses : 9
% 0.23/0.55 # Removed in clause preprocessing : 0
% 0.23/0.55 # Initial clauses in saturation : 9
% 0.23/0.55 # Processed clauses : 27
% 0.23/0.55 # ...of these trivial : 1
% 0.23/0.55 # ...subsumed : 1
% 0.23/0.55 # ...remaining for further processing : 25
% 0.23/0.55 # Other redundant clauses eliminated : 0
% 0.23/0.55 # Clauses deleted for lack of memory : 0
% 0.23/0.55 # Backward-subsumed : 0
% 0.23/0.55 # Backward-rewritten : 3
% 0.23/0.55 # Generated clauses : 23
% 0.23/0.55 # ...of the previous two non-redundant : 22
% 0.23/0.55 # ...aggressively subsumed : 0
% 0.23/0.55 # Contextual simplify-reflections : 3
% 0.23/0.55 # Paramodulations : 22
% 0.23/0.55 # Factorizations : 0
% 0.23/0.55 # NegExts : 0
% 0.23/0.55 # Equation resolutions : 0
% 0.23/0.55 # Disequality decompositions : 0
% 0.23/0.55 # Total rewrite steps : 5
% 0.23/0.55 # ...of those cached : 3
% 0.23/0.55 # Propositional unsat checks : 0
% 0.23/0.55 # Propositional check models : 0
% 0.23/0.55 # Propositional check unsatisfiable : 0
% 0.23/0.55 # Propositional clauses : 0
% 0.23/0.55 # Propositional clauses after purity: 0
% 0.23/0.55 # Propositional unsat core size : 0
% 0.23/0.55 # Propositional preprocessing time : 0.000
% 0.23/0.55 # Propositional encoding time : 0.000
% 0.23/0.55 # Propositional solver time : 0.000
% 0.23/0.55 # Success case prop preproc time : 0.000
% 0.23/0.55 # Success case prop encoding time : 0.000
% 0.23/0.55 # Success case prop solver time : 0.000
% 0.23/0.55 # Current number of processed clauses : 13
% 0.23/0.55 # Positive orientable unit clauses : 2
% 0.23/0.55 # Positive unorientable unit clauses: 0
% 0.23/0.55 # Negative unit clauses : 3
% 0.23/0.55 # Non-unit-clauses : 8
% 0.23/0.55 # Current number of unprocessed clauses: 10
% 0.23/0.55 # ...number of literals in the above : 29
% 0.23/0.55 # Current number of archived formulas : 0
% 0.23/0.55 # Current number of archived clauses : 12
% 0.23/0.55 # Clause-clause subsumption calls (NU) : 22
% 0.23/0.55 # Rec. Clause-clause subsumption calls : 21
% 0.23/0.55 # Non-unit clause-clause subsumptions : 4
% 0.23/0.55 # Unit Clause-clause subsumption calls : 2
% 0.23/0.55 # Rewrite failures with RHS unbound : 0
% 0.23/0.55 # BW rewrite match attempts : 2
% 0.23/0.55 # BW rewrite match successes : 2
% 0.23/0.55 # Condensation attempts : 27
% 0.23/0.55 # Condensation successes : 0
% 0.23/0.55 # Termbank termtop insertions : 1016
% 0.23/0.55 # Search garbage collected termcells : 149
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.006 s
% 0.23/0.55 # System time : 0.001 s
% 0.23/0.55 # Total time : 0.007 s
% 0.23/0.55 # Maximum resident set size: 1796 pages
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.009 s
% 0.23/0.55 # System time : 0.002 s
% 0.23/0.55 # Total time : 0.011 s
% 0.23/0.55 # Maximum resident set size: 1716 pages
% 0.23/0.55 % E---3.1 exiting
% 0.23/0.55 % E exiting
%------------------------------------------------------------------------------