TSTP Solution File: ALG284^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG284^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 26 ( 25 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 133 ( 3 ~; 0 |; 7 &; 121 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 ^ 37 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cJ: $i > $i ).
thf(decl_23,type,
cP: $i > $i > $i ).
thf(decl_24,type,
cE: $i ).
thf(decl_25,type,
esk1_0: $i ).
thf(decl_26,type,
esk2_0: $i ).
thf(cTHM18_pme,conjecture,
( ( ! [X1: $i,X2: $i,X3: $i] :
( ( cP @ ( cP @ X1 @ X2 ) @ X3 )
= ( cP @ X1 @ ( cP @ X2 @ X3 ) ) )
& ! [X1: $i] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: $i] :
( ( cP @ ( cJ @ X2 ) @ X2 )
= cE ) )
=> ! [X4: $i,X5: $i] :
( ( cJ @ ( cP @ X4 @ X5 ) )
= ( cP @ ( cJ @ X5 ) @ ( cJ @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM18_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i,X2: $i,X3: $i] :
( ( cP @ ( cP @ X1 @ X2 ) @ X3 )
= ( cP @ X1 @ ( cP @ X2 @ X3 ) ) )
& ! [X1: $i] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: $i] :
( ( cP @ ( cJ @ X2 ) @ X2 )
= cE ) )
=> ! [X4: $i,X5: $i] :
( ( cJ @ ( cP @ X4 @ X5 ) )
= ( cP @ ( cJ @ X5 ) @ ( cJ @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM18_pme]) ).
thf(c_0_2,negated_conjecture,
! [X13: $i,X14: $i,X15: $i,X16: $i,X17: $i] :
( ( ( cP @ ( cP @ X13 @ X14 ) @ X15 )
= ( cP @ X13 @ ( cP @ X14 @ X15 ) ) )
& ( ( cP @ cE @ X16 )
= X16 )
& ( ( cP @ ( cJ @ X17 ) @ X17 )
= cE )
& ( ( cJ @ ( cP @ esk1_0 @ esk2_0 ) )
!= ( cP @ ( cJ @ esk2_0 ) @ ( cJ @ esk1_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: $i,X2: $i,X3: $i] :
( ( cP @ ( cP @ X1 @ X2 ) @ X3 )
= ( cP @ X1 @ ( cP @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i] :
( ( cP @ ( cJ @ X1 ) @ X1 )
= cE ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i] :
( ( cP @ cE @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cP @ ( cJ @ X1 ) @ ( cP @ X1 @ X2 ) )
= X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ( cP @ ( cJ @ ( cJ @ X1 ) ) @ cE )
= X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] :
( ( cP @ ( cJ @ ( cJ @ ( cJ @ X1 ) ) ) @ X1 )
= cE ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( cJ @ ( cJ @ X1 ) )
= X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( ( cP @ X1 @ ( cJ @ X1 ) )
= cE ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cP @ X1 @ ( cP @ X2 @ ( cJ @ ( cP @ X1 @ X2 ) ) ) )
= cE ),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
( ( cP @ X1 @ cE )
= X1 ),
inference(rw,[status(thm)],[c_0_7,c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cP @ X1 @ ( cJ @ ( cP @ X2 @ X1 ) ) )
= ( cJ @ X2 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
( ( cJ @ ( cP @ esk1_0 @ esk2_0 ) )
!= ( cP @ ( cJ @ esk2_0 ) @ ( cJ @ esk1_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
! [X2: $i,X1: $i] :
( ( cP @ ( cJ @ X1 ) @ ( cJ @ X2 ) )
= ( cJ @ ( cP @ X2 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ALG284^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 23:14:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.53 Running higher-order theorem proving
% 0.21/0.53 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.21/0.54 # Version: 3.1.0-ho
% 0.21/0.54 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.54 # Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.54 # Starting sh4l with 300s (1) cores
% 0.21/0.54 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.21/0.54 # new_ho_10 with pid 22392 completed with status 0
% 0.21/0.54 # Result found by new_ho_10
% 0.21/0.54 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: HUUPS-FFSF21-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting new_ho_10 with 901s (1) cores
% 0.21/0.54 # Starting sh5l with 151s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 151s (1) cores
% 0.21/0.54 # Starting new_bool_2 with 151s (1) cores
% 0.21/0.54 # Starting new_bool_9 with 146s (1) cores
% 0.21/0.54 # sh5l with pid 22399 completed with status 0
% 0.21/0.54 # Result found by sh5l
% 0.21/0.54 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: HUUPS-FFSF21-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting new_ho_10 with 901s (1) cores
% 0.21/0.54 # Starting sh5l with 151s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 4
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 7
% 0.21/0.54 # Removed in clause preprocessing : 3
% 0.21/0.54 # Initial clauses in saturation : 4
% 0.21/0.54 # Processed clauses : 25
% 0.21/0.54 # ...of these trivial : 3
% 0.21/0.54 # ...subsumed : 0
% 0.21/0.54 # ...remaining for further processing : 22
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 6
% 0.21/0.54 # Generated clauses : 105
% 0.21/0.54 # ...of the previous two non-redundant : 33
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 105
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 146
% 0.21/0.54 # ...of those cached : 93
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 12
% 0.21/0.54 # Positive orientable unit clauses : 12
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 0
% 0.21/0.54 # Non-unit-clauses : 0
% 0.21/0.54 # Current number of unprocessed clauses: 15
% 0.21/0.54 # ...number of literals in the above : 15
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 10
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.54 # Non-unit clause-clause subsumptions : 0
% 0.21/0.54 # Unit Clause-clause subsumption calls : 0
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 12
% 0.21/0.54 # BW rewrite match successes : 6
% 0.21/0.54 # Condensation attempts : 25
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 1303
% 0.21/0.54 # Search garbage collected termcells : 111
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.004 s
% 0.21/0.54 # System time : 0.002 s
% 0.21/0.54 # Total time : 0.006 s
% 0.21/0.54 # Maximum resident set size: 1728 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.015 s
% 0.21/0.54 # System time : 0.006 s
% 0.21/0.54 # Total time : 0.021 s
% 0.21/0.54 # Maximum resident set size: 1696 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------