TSTP Solution File: ALG254^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG254^2 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:52 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of formulae : 29 ( 7 unt; 13 typ; 0 def)
% Number of atoms : 46 ( 34 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 176 ( 10 ~; 5 |; 9 &; 138 @)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 12 con; 0-2 aty)
% Number of variables : 40 ( 0 ^ 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
subst: $tType ).
thf(decl_26,type,
id: subst ).
thf(decl_29,type,
comp: subst > subst > subst ).
thf(decl_83,type,
axassoc: $o ).
thf(decl_96,type,
axidr: $o ).
thf(decl_111,type,
axidl: $o ).
thf(decl_115,type,
substmonoid_lthm: $o ).
thf(decl_120,type,
substmonoid: $o ).
thf(decl_144,type,
esk1_0: subst ).
thf(decl_145,type,
esk2_0: subst ).
thf(decl_146,type,
esk3_0: subst ).
thf(decl_147,type,
esk4_0: subst ).
thf(decl_148,type,
esk5_0: subst ).
thf(substmonoid_lthm,axiom,
( substmonoid_lthm
<=> ( axidl
=> ( axassoc
=> ( axidr
=> substmonoid ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax',substmonoid_lthm) ).
thf(axidl,axiom,
( axidl
<=> ! [X3: subst] :
( ( comp @ id @ X3 )
= X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax',axidl) ).
thf(axassoc,axiom,
( axassoc
<=> ! [X3: subst,X4: subst,X5: subst] :
( ( comp @ ( comp @ X3 @ X4 ) @ X5 )
= ( comp @ X3 @ ( comp @ X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax',axassoc) ).
thf(axidr,axiom,
( axidr
<=> ! [X3: subst] :
( ( comp @ X3 @ id )
= X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax',axidr) ).
thf(substmonoid,axiom,
( substmonoid
<=> ( ! [X3: subst,X4: subst,X5: subst] :
( ( comp @ ( comp @ X3 @ X4 ) @ X5 )
= ( comp @ X3 @ ( comp @ X4 @ X5 ) ) )
& ! [X3: subst] :
( ( comp @ id @ X3 )
= X3 )
& ! [X3: subst] :
( ( comp @ X3 @ id )
= X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax',substmonoid) ).
thf(thm,conjecture,
substmonoid_lthm,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(c_0_6,axiom,
( substmonoid_lthm
= ( ! [X38: subst] :
( ( comp @ id @ X38 )
= X38 )
=> ( ! [X39: subst,X40: subst,X41: subst] :
( ( comp @ ( comp @ X39 @ X40 ) @ X41 )
= ( comp @ X39 @ ( comp @ X40 @ X41 ) ) )
=> ( ! [X42: subst] :
( ( comp @ X42 @ id )
= X42 )
=> ( ! [X43: subst,X44: subst,X45: subst] :
( ( comp @ ( comp @ X43 @ X44 ) @ X45 )
= ( comp @ X43 @ ( comp @ X44 @ X45 ) ) )
& ! [X46: subst] :
( ( comp @ id @ X46 )
= X46 )
& ! [X47: subst] :
( ( comp @ X47 @ id )
= X47 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[substmonoid_lthm,axidl]),axassoc]),axidr]),substmonoid]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X48: subst] :
( ( comp @ id @ X48 )
= X48 )
=> ( ! [X49: subst,X50: subst,X51: subst] :
( ( comp @ ( comp @ X49 @ X50 ) @ X51 )
= ( comp @ X49 @ ( comp @ X50 @ X51 ) ) )
=> ( ! [X52: subst] :
( ( comp @ X52 @ id )
= X52 )
=> ( ! [X53: subst,X54: subst,X55: subst] :
( ( comp @ ( comp @ X53 @ X54 ) @ X55 )
= ( comp @ X53 @ ( comp @ X54 @ X55 ) ) )
& ! [X56: subst] :
( ( comp @ id @ X56 )
= X56 )
& ! [X57: subst] :
( ( comp @ X57 @ id )
= X57 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X58: subst,X59: subst,X60: subst,X61: subst,X62: subst] :
( ( ( comp @ id @ X58 )
= X58 )
& ( ( comp @ ( comp @ X59 @ X60 ) @ X61 )
= ( comp @ X59 @ ( comp @ X60 @ X61 ) ) )
& ( ( comp @ X62 @ id )
= X62 )
& ( ( ( comp @ ( comp @ esk1_0 @ esk2_0 ) @ esk3_0 )
!= ( comp @ esk1_0 @ ( comp @ esk2_0 @ esk3_0 ) ) )
| ( ( comp @ id @ esk4_0 )
!= esk4_0 )
| ( ( comp @ esk5_0 @ id )
!= esk5_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_7])])])])]) ).
thf(c_0_9,negated_conjecture,
( ( ( comp @ ( comp @ esk1_0 @ esk2_0 ) @ esk3_0 )
!= ( comp @ esk1_0 @ ( comp @ esk2_0 @ esk3_0 ) ) )
| ( ( comp @ id @ esk4_0 )
!= esk4_0 )
| ( ( comp @ esk5_0 @ id )
!= esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X3: subst] :
( ( comp @ X3 @ id )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
( ( ( comp @ ( comp @ esk1_0 @ esk2_0 ) @ esk3_0 )
!= ( comp @ esk1_0 @ ( comp @ esk2_0 @ esk3_0 ) ) )
| ( ( comp @ id @ esk4_0 )
!= esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_12,negated_conjecture,
! [X3: subst] :
( ( comp @ id @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( comp @ ( comp @ esk1_0 @ esk2_0 ) @ esk3_0 )
!= ( comp @ esk1_0 @ ( comp @ esk2_0 @ esk3_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
thf(c_0_14,negated_conjecture,
! [X3: subst,X4: subst,X5: subst] :
( ( comp @ ( comp @ X3 @ X4 ) @ X5 )
= ( comp @ X3 @ ( comp @ X4 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG254^2 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.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 22:54:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.51 Running higher-order theorem proving
% 0.21/0.51 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: HSMMSLSSLLLNHFA.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.54 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.54 # Starting post_as_ho5 with 300s (1) cores
% 0.21/0.54 # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.54 # post_as_ho5 with pid 3114 completed with status 0
% 0.21/0.54 # Result found by post_as_ho5
% 0.21/0.54 # Preprocessing class: HSMMSLSSLLLNHFA.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.54 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.54 # Starting post_as_ho5 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.21/0.54 # Search class: HUHPS-FFSF22-SHFMMFNN
% 0.21/0.54 # partial match(3): HHUPS-FFSF32-SHFMMFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.54 # new_ho_10 with pid 3116 completed with status 0
% 0.21/0.54 # Result found by new_ho_10
% 0.21/0.54 # Preprocessing class: HSMMSLSSLLLNHFA.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.54 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.54 # Starting post_as_ho5 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.21/0.54 # Search class: HUHPS-FFSF22-SHFMMFNN
% 0.21/0.54 # partial match(3): HHUPS-FFSF32-SHFMMFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.54 # Preprocessing time : 0.003 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 : 238
% 0.21/0.54 # Removed by relevancy pruning/SinE : 232
% 0.21/0.54 # Initial clauses : 4
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 4
% 0.21/0.54 # Processed clauses : 6
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 0
% 0.21/0.54 # ...remaining for further processing : 6
% 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 : 3
% 0.21/0.54 # Generated clauses : 0
% 0.21/0.54 # ...of the previous two non-redundant : 2
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 0
% 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 : 3
% 0.21/0.54 # ...of those cached : 0
% 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 : 3
% 0.21/0.54 # Positive orientable unit clauses : 3
% 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: 0
% 0.21/0.54 # ...number of literals in the above : 0
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 3
% 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 : 3
% 0.21/0.54 # BW rewrite match successes : 3
% 0.21/0.54 # Condensation attempts : 6
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 5235
% 0.21/0.54 # Search garbage collected termcells : 1964
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.004 s
% 0.21/0.54 # System time : 0.003 s
% 0.21/0.54 # Total time : 0.008 s
% 0.21/0.54 # Maximum resident set size: 2412 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.013 s
% 0.21/0.54 # System time : 0.006 s
% 0.21/0.54 # Total time : 0.019 s
% 0.21/0.54 # Maximum resident set size: 2076 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------