TSTP Solution File: ALG282^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG282^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 18:06:01 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 18 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 21 ( 20 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 89 ( 5 ~; 0 |; 7 &; 75 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 0 ^ 32 !; 2 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
cP: a > a > a ).
thf(decl_23,type,
cE: a ).
thf(decl_24,type,
cJ: a > a ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
esk2_0: a ).
thf(cTHM21_pme,conjecture,
( ( ! [X1: a,X2: a,X3: a] :
( ( cP @ ( cP @ X1 @ X2 ) @ X3 )
= ( cP @ X1 @ ( cP @ X2 @ X3 ) ) )
& ! [X1: a] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: a] :
( ( cP @ ( cJ @ X2 ) @ X2 )
= cE ) )
=> ! [X4: a,X5: a] :
? [X6: a] :
( ( cP @ X6 @ X4 )
= X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM21_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a] :
( ( cP @ ( cP @ X1 @ X2 ) @ X3 )
= ( cP @ X1 @ ( cP @ X2 @ X3 ) ) )
& ! [X1: a] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: a] :
( ( cP @ ( cJ @ X2 ) @ X2 )
= cE ) )
=> ! [X4: a,X5: a] :
? [X6: a] :
( ( cP @ X6 @ X4 )
= X5 ) ),
inference(assume_negation,[status(cth)],[cTHM21_pme]) ).
thf(c_0_2,negated_conjecture,
! [X15: a,X16: a,X17: a,X18: a,X19: a,X22: a] :
( ( ( cP @ ( cP @ X15 @ X16 ) @ X17 )
= ( cP @ X15 @ ( cP @ X16 @ X17 ) ) )
& ( ( cP @ cE @ X18 )
= X18 )
& ( ( cP @ ( cJ @ X19 ) @ X19 )
= cE )
& ( ( cP @ X22 @ esk1_0 )
!= esk2_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,
! [X1: a] :
( ( cP @ X1 @ esk1_0 )
!= esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a,X2: a,X3: a] :
( ( cP @ ( cP @ X1 @ X2 ) @ X3 )
= ( cP @ X1 @ ( cP @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a] :
( ( cP @ ( cJ @ X1 ) @ X1 )
= cE ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X1: a] :
( ( cP @ cE @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: a,X2: a] :
( ( cP @ X1 @ ( cP @ X2 @ esk1_0 ) )
!= esk2_0 ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: a,X2: a] :
( ( cP @ ( cJ @ X1 ) @ ( cP @ X1 @ X2 ) )
= X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: a] :
( ( cP @ X1 @ cE )
!= esk2_0 ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
thf(c_0_10,negated_conjecture,
! [X1: a] :
( ( cP @ ( cJ @ ( cJ @ X1 ) ) @ cE )
= X1 ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ALG282^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.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 23:05:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.49 # ehoh_best_nonlift_rwall with pid 7661 completed with status 0
% 0.20/0.49 # Result found by ehoh_best_nonlift_rwall
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HUUPS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 7663 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HUUPS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 5
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 8
% 0.20/0.49 # Removed in clause preprocessing : 4
% 0.20/0.49 # Initial clauses in saturation : 4
% 0.20/0.49 # Processed clauses : 19
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 4
% 0.20/0.49 # ...remaining for further processing : 15
% 0.20/0.49 # Other redundant clauses eliminated : 1
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 32
% 0.20/0.49 # ...of the previous two non-redundant : 25
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 31
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 1
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 10
% 0.20/0.49 # ...of those cached : 1
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 11
% 0.20/0.49 # Positive orientable unit clauses : 6
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 5
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 12
% 0.20/0.49 # ...number of literals in the above : 12
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 4
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 5
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 19
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 507
% 0.20/0.49 # Search garbage collected termcells : 110
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1568 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1708 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------