TSTP Solution File: ALG001^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG001^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Mon May 20 17:59:08 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 17 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 13 ( 12 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 105 ( 3 ~; 0 |; 4 &; 96 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 ^ 30 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
g: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_sort3,type,
a: $tType ).
thf(decl_22,type,
esk1_0: g > b ).
thf(decl_23,type,
esk2_0: b > a ).
thf(decl_24,type,
esk3_0: g > g > g ).
thf(decl_25,type,
esk4_0: b > b > b ).
thf(decl_26,type,
esk5_0: a > a > a ).
thf(decl_27,type,
esk6_0: g ).
thf(decl_28,type,
esk7_0: g ).
thf(cTHM133_pme,conjecture,
! [X1: g > b,X2: b > a,X3: g > g > g,X4: b > b > b,X5: a > a > a] :
( ( ! [X6: g,X7: g] :
( ( X1 @ ( X3 @ X6 @ X7 ) )
= ( X4 @ ( X1 @ X6 ) @ ( X1 @ X7 ) ) )
& ! [X8: b,X9: b] :
( ( X2 @ ( X4 @ X8 @ X9 ) )
= ( X5 @ ( X2 @ X8 ) @ ( X2 @ X9 ) ) ) )
=> ! [X6: g,X7: g] :
( ( X2 @ ( X1 @ ( X3 @ X6 @ X7 ) ) )
= ( X5 @ ( X2 @ ( X1 @ X6 ) ) @ ( X2 @ ( X1 @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM133_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: g > b,X2: b > a,X3: g > g > g,X4: b > b > b,X5: a > a > a] :
( ( ! [X6: g,X7: g] :
( ( X1 @ ( X3 @ X6 @ X7 ) )
= ( X4 @ ( X1 @ X6 ) @ ( X1 @ X7 ) ) )
& ! [X8: b,X9: b] :
( ( X2 @ ( X4 @ X8 @ X9 ) )
= ( X5 @ ( X2 @ X8 ) @ ( X2 @ X9 ) ) ) )
=> ! [X6: g,X7: g] :
( ( X2 @ ( X1 @ ( X3 @ X6 @ X7 ) ) )
= ( X5 @ ( X2 @ ( X1 @ X6 ) ) @ ( X2 @ ( X1 @ X7 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM133_pme]) ).
thf(c_0_2,negated_conjecture,
! [X26: g,X27: g,X28: b,X29: b] :
( ( ( esk1_0 @ ( esk3_0 @ X26 @ X27 ) )
= ( esk4_0 @ ( esk1_0 @ X26 ) @ ( esk1_0 @ X27 ) ) )
& ( ( esk2_0 @ ( esk4_0 @ X28 @ X29 ) )
= ( esk5_0 @ ( esk2_0 @ X28 ) @ ( esk2_0 @ X29 ) ) )
& ( ( esk2_0 @ ( esk1_0 @ ( esk3_0 @ esk6_0 @ esk7_0 ) ) )
!= ( esk5_0 @ ( esk2_0 @ ( esk1_0 @ esk6_0 ) ) @ ( esk2_0 @ ( esk1_0 @ esk7_0 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
( ( esk2_0 @ ( esk1_0 @ ( esk3_0 @ esk6_0 @ esk7_0 ) ) )
!= ( esk5_0 @ ( esk2_0 @ ( esk1_0 @ esk6_0 ) ) @ ( esk2_0 @ ( esk1_0 @ esk7_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X8: b,X9: b] :
( ( esk2_0 @ ( esk4_0 @ X8 @ X9 ) )
= ( esk5_0 @ ( esk2_0 @ X8 ) @ ( esk2_0 @ X9 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X6: g,X7: g] :
( ( esk1_0 @ ( esk3_0 @ X6 @ X7 ) )
= ( esk4_0 @ ( esk1_0 @ X6 ) @ ( esk1_0 @ X7 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG001^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 23:24:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.50 # post_as_ho12 with pid 13970 completed with status 0
% 0.21/0.50 # Result found by post_as_ho12
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HUUPS-FFSF00-MSSFFFNN
% 0.21/0.50 # partial match(2): HUUPF-FFSF00-SSSFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.50 # new_ho_10 with pid 13979 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HUUPS-FFSF00-MSSFFFNN
% 0.21/0.50 # partial match(2): HUUPF-FFSF00-SSSFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 4
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 6
% 0.21/0.50 # Removed in clause preprocessing : 3
% 0.21/0.50 # Initial clauses in saturation : 3
% 0.21/0.50 # Processed clauses : 3
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 3
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 1
% 0.21/0.50 # Generated clauses : 0
% 0.21/0.50 # ...of the previous two non-redundant : 0
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 0
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 2
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 2
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 0
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 1
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 3
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 404
% 0.21/0.50 # Search garbage collected termcells : 172
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.004 s
% 0.21/0.50 # Maximum resident set size: 1772 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.006 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1728 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------