TSTP Solution File: ALG270^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG270^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:05:59 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 12 ( 3 unt; 6 typ; 0 def)
% Number of atoms : 9 ( 8 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 86 ( 3 ~; 0 |; 1 &; 80 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 ^ 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
c_star: a > a > a ).
thf(decl_23,type,
esk1_0: a ).
thf(decl_24,type,
esk2_0: a ).
thf(decl_25,type,
esk3_0: a ).
thf(decl_26,type,
esk4_0: a ).
thf(cTHM23_pme,conjecture,
( ! [X1: a,X2: a,X3: a] :
( ( c_star @ ( c_star @ X1 @ X2 ) @ X3 )
= ( c_star @ X1 @ ( c_star @ X2 @ X3 ) ) )
=> ! [X4: a,X5: a,X6: a,X7: a] :
( ( c_star @ ( c_star @ ( c_star @ X4 @ X5 ) @ X6 ) @ X7 )
= ( c_star @ X4 @ ( c_star @ X5 @ ( c_star @ X6 @ X7 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM23_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: a,X2: a,X3: a] :
( ( c_star @ ( c_star @ X1 @ X2 ) @ X3 )
= ( c_star @ X1 @ ( c_star @ X2 @ X3 ) ) )
=> ! [X4: a,X5: a,X6: a,X7: a] :
( ( c_star @ ( c_star @ ( c_star @ X4 @ X5 ) @ X6 ) @ X7 )
= ( c_star @ X4 @ ( c_star @ X5 @ ( c_star @ X6 @ X7 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM23_pme]) ).
thf(c_0_2,negated_conjecture,
! [X15: a,X16: a,X17: a] :
( ( ( c_star @ ( c_star @ X15 @ X16 ) @ X17 )
= ( c_star @ X15 @ ( c_star @ X16 @ X17 ) ) )
& ( ( c_star @ ( c_star @ ( c_star @ esk1_0 @ esk2_0 ) @ esk3_0 ) @ esk4_0 )
!= ( c_star @ esk1_0 @ ( c_star @ esk2_0 @ ( c_star @ esk3_0 @ esk4_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,
( ( c_star @ ( c_star @ ( c_star @ esk1_0 @ esk2_0 ) @ esk3_0 ) @ esk4_0 )
!= ( c_star @ esk1_0 @ ( c_star @ esk2_0 @ ( c_star @ esk3_0 @ esk4_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a,X2: a,X3: a] :
( ( c_star @ ( c_star @ X1 @ X2 ) @ X3 )
= ( c_star @ X1 @ ( c_star @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_4])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ALG270^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat May 18 23:34:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.49 Running higher-order theorem proving
% 0.19/0.49 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.50 # Version: 3.1.0-ho
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.50 # Starting sh4l with 300s (1) cores
% 0.19/0.50 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.50 # sh4l with pid 10324 completed with status 0
% 0.19/0.50 # Result found by sh4l
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.50 # Starting sh4l with 300s (1) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HUUPF-FFSF22-MFFFFFNN
% 0.19/0.50 # partial match(1): FUUPF-FFSF22-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 84s (1) cores
% 0.19/0.50 # G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with pid 10329 completed with status 0
% 0.19/0.50 # Result found by G-E--_209_C18_F1_AE_CS_SP_PI_S0Y
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.50 # Starting sh4l with 300s (1) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HUUPF-FFSF22-MFFFFFNN
% 0.19/0.50 # partial match(1): FUUPF-FFSF22-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 84s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 3
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 4
% 0.19/0.50 # Removed in clause preprocessing : 2
% 0.19/0.50 # Initial clauses in saturation : 2
% 0.19/0.50 # Processed clauses : 2
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 1
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 1
% 0.19/0.50 # ...of the previous two non-redundant : 0
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 1
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 6
% 0.19/0.50 # ...of those cached : 0
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 1
% 0.19/0.50 # Positive orientable unit clauses : 1
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 0
% 0.19/0.50 # Current number of unprocessed clauses: 0
% 0.19/0.50 # ...number of literals in the above : 0
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 0
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.50 # Non-unit clause-clause subsumptions : 0
% 0.19/0.50 # Unit Clause-clause subsumption calls : 0
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 0
% 0.19/0.50 # BW rewrite match successes : 0
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 276
% 0.19/0.50 # Search garbage collected termcells : 81
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.004 s
% 0.19/0.50 # System time : 0.000 s
% 0.19/0.50 # Total time : 0.004 s
% 0.19/0.50 # Maximum resident set size: 1612 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.004 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.007 s
% 0.19/0.50 # Maximum resident set size: 1712 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------