TSTP Solution File: PUZ140^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ140^2 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 02:25:19 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 17 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 22 ( 12 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 45 ( 9 ~; 5 |; 6 &; 25 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 0 ^ 11 !; 4 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
beverage: $tType ).
thf(decl_sort2,type,
syrup: $tType ).
thf(decl_22,type,
coffee: beverage ).
thf(decl_24,type,
coffee_mixture: syrup > beverage ).
thf(decl_25,type,
hot: beverage > $o ).
thf(decl_26,type,
esk1_1: ( syrup > beverage ) > syrup ).
thf(there_is_hot_coffee,conjecture,
? [X2: syrup > beverage] :
! [X1: syrup] :
? [X3: beverage] :
( ( X3
= ( X2 @ X1 ) )
& ( X3 = coffee )
& ( hot @ X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',there_is_hot_coffee) ).
thf(coffee_and_syrup_is_hot_coffee,axiom,
! [X1: syrup] :
( ( ( coffee_mixture @ X1 )
= coffee )
& ( hot @ ( coffee_mixture @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',coffee_and_syrup_is_hot_coffee) ).
thf(c_0_2,negated_conjecture,
~ ? [X2: syrup > beverage] :
! [X1: syrup] :
? [X3: beverage] :
( ( X3
= ( X2 @ X1 ) )
& ( X3 = coffee )
& ( hot @ X3 ) ),
inference(assume_negation,[status(cth)],[there_is_hot_coffee]) ).
thf(c_0_3,negated_conjecture,
! [X9: syrup > beverage,X11: beverage] :
( ( X11
!= ( X9 @ ( esk1_1 @ X9 ) ) )
| ( X11 != coffee )
| ~ ( hot @ X11 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
thf(c_0_4,plain,
! [X8: syrup] :
( ( ( coffee_mixture @ X8 )
= coffee )
& ( hot @ ( coffee_mixture @ X8 ) ) ),
inference(variable_rename,[status(thm)],[coffee_and_syrup_is_hot_coffee]) ).
thf(c_0_5,negated_conjecture,
! [X2: syrup > beverage,X3: beverage] :
( ( X3
!= ( X2 @ ( esk1_1 @ X2 ) ) )
| ( X3 != coffee )
| ~ ( hot @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
! [X1: syrup] : ( hot @ ( coffee_mixture @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X1: syrup] :
( ( coffee_mixture @ X1 )
= coffee ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X2: syrup > beverage] :
( ( ( X2 @ ( esk1_1 @ X2 ) )
!= coffee )
| ~ ( hot @ ( X2 @ ( esk1_1 @ X2 ) ) ) ),
inference(er,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
hot @ coffee,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ140^2 : TPTP v8.2.0. Released v6.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 10:42:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho4 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.48 # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.48 # Starting new_ho_8 with 300s (1) cores
% 0.19/0.48 # post_as_ho12 with pid 26310 completed with status 0
% 0.19/0.48 # Result found by post_as_ho12
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HUHSS-FFSF21-SSSFFSNN
% 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 26318 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HUHSS-FFSF21-SSSFFSNN
% 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 : 9
% 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 : 9
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 9
% 0.19/0.48 # Other redundant clauses eliminated : 1
% 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 : 3
% 0.19/0.48 # ...of the previous two non-redundant : 2
% 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 : 1
% 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 : 3
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 0
% 0.19/0.48 # Non-unit-clauses : 1
% 0.19/0.48 # Current number of unprocessed clauses: 1
% 0.19/0.48 # ...number of literals in the above : 1
% 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) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 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 : 2
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 9
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 313
% 0.19/0.48 # Search garbage collected termcells : 57
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.003 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.004 s
% 0.19/0.48 # Maximum resident set size: 1768 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.004 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1716 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------