TSTP Solution File: AGT040^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : AGT040^1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:57:49 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 31
% Syntax : Number of formulae : 62 ( 30 unt; 17 typ; 0 def)
% Number of atoms : 96 ( 20 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 202 ( 29 ~; 20 |; 0 &; 150 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 87 ( 87 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 4 con; 0-3 aty)
% Number of variables : 94 ( 44 ^ 47 !; 3 ?; 94 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_40,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(decl_41,type,
mserial: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
a1: $i > $i > $o ).
thf(decl_57,type,
piotr: mu ).
thf(decl_58,type,
cola: mu ).
thf(decl_61,type,
likes: mu > mu > $i > $o ).
thf(decl_63,type,
possibly_likes: mu > mu > $i > $o ).
thf(decl_71,type,
esk6_1: $i > $i ).
thf(decl_74,type,
esk9_0: $i ).
thf(msymmetric,axiom,
( msymmetric
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( X13 @ X15 @ X16 )
=> ( X13 @ X16 @ X15 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',msymmetric) ).
thf(mserial,axiom,
( mserial
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( X13 @ X15 @ X16 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mserial) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mdia) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(axioms_B_a1,axiom,
msymmetric @ a1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axioms_B_a1) ).
thf(axioms_D_a1,axiom,
mserial @ a1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axioms_D_a1) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(axiom_a2_2,axiom,
mvalid @ ( mbox @ a1 @ ( likes @ piotr @ cola ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_a2_2) ).
thf(axiom_user_communication_3,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mimplies @ ( mdia @ a1 @ ( likes @ X1 @ X2 ) ) @ ( possibly_likes @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_user_communication_3) ).
thf(conj,conjecture,
mvalid @ ( possibly_likes @ piotr @ cola ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_14,plain,
( msymmetric
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( Z0 @ X15 @ X16 )
=> ( Z0 @ X16 @ X15 ) ) ) ),
inference(fof_simplification,[status(thm)],[msymmetric]) ).
thf(c_0_15,plain,
( mserial
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( Z0 @ X15 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mserial]) ).
thf(c_0_16,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_17,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_18,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_19,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X24: $i] :
( ~ ( Z0 @ Z2 @ X24 )
| ~ ( Z1 @ X24 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_20,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_21,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_22,plain,
! [X81: $i,X82: $i] :
( ( a1 @ X81 @ X82 )
=> ( a1 @ X82 @ X81 ) ),
inference(apply_def,[status(thm)],[axioms_B_a1,c_0_14]) ).
thf(c_0_23,plain,
! [X87: $i] :
? [X88: $i] : ( a1 @ X87 @ X88 ),
inference(apply_def,[status(thm)],[axioms_D_a1,c_0_15]) ).
thf(c_0_24,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
thf(c_0_25,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_26,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X24: $i] :
( ~ ( Z0 @ Z2 @ X24 )
| ~ ( Z1 @ X24 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_17]),c_0_20]) ).
thf(c_0_27,plain,
! [X40: $i,X39: $i] :
( ~ ( a1 @ X40 @ X39 )
| ( likes @ piotr @ cola @ X39 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_a2_2,c_0_20]),c_0_21])]) ).
thf(c_0_28,plain,
! [X192: $i,X193: $i] :
( ~ ( a1 @ X192 @ X193 )
| ( a1 @ X193 @ X192 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
thf(c_0_29,plain,
! [X198: $i] : ( a1 @ X198 @ ( esk6_1 @ X198 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
thf(c_0_30,plain,
! [X72: $i,X71: mu,X70: mu] :
( ~ ~ ! [X69: $i] :
( ~ ( a1 @ X72 @ X69 )
| ~ ( likes @ X71 @ X70 @ X69 ) )
| ( possibly_likes @ X71 @ X70 @ X72 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_user_communication_3]),c_0_24]),c_0_25]),c_0_26]),c_0_21])]) ).
thf(c_0_31,plain,
! [X150: $i,X151: $i] :
( ~ ( a1 @ X150 @ X151 )
| ( likes @ piotr @ cola @ X151 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_27])]) ).
thf(c_0_32,plain,
! [X3: $i,X14: $i] :
( ( a1 @ X14 @ X3 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,plain,
! [X3: $i] : ( a1 @ X3 @ ( esk6_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_34,plain,
! [X180: $i,X181: mu,X182: mu,X183: $i] :
( ~ ( a1 @ X180 @ X183 )
| ~ ( likes @ X181 @ X182 @ X183 )
| ( possibly_likes @ X181 @ X182 @ X180 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).
thf(c_0_35,plain,
! [X3: $i,X14: $i] :
( ( likes @ piotr @ cola @ X14 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_36,plain,
! [X3: $i] : ( a1 @ ( esk6_1 @ X3 ) @ X3 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_37,negated_conjecture,
~ ! [X135: $i] : ( possibly_likes @ piotr @ cola @ X135 ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_21]) ).
thf(c_0_38,plain,
! [X3: $i,X2: mu,X1: mu,X14: $i] :
( ( possibly_likes @ X1 @ X2 @ X3 )
| ~ ( a1 @ X3 @ X14 )
| ~ ( likes @ X1 @ X2 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_39,plain,
! [X3: $i] : ( likes @ piotr @ cola @ X3 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
thf(c_0_40,negated_conjecture,
~ ( possibly_likes @ piotr @ cola @ esk9_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])]) ).
thf(c_0_41,plain,
! [X3: $i,X14: $i] :
( ( possibly_likes @ piotr @ cola @ X3 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_42,negated_conjecture,
~ ( possibly_likes @ piotr @ cola @ esk9_0 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
thf(c_0_43,plain,
! [X3: $i] : ( possibly_likes @ piotr @ cola @ X3 ),
inference(spm,[status(thm)],[c_0_41,c_0_33]) ).
thf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : AGT040^1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 18:49:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 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.22/0.53 # Version: 3.1.0-ho
% 0.22/0.53 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.53 # Starting post_as_ho3 with 300s (1) cores
% 0.22/0.53 # Starting new_ho_12 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_2 with 300s (1) cores
% 0.22/0.53 # post_as_ho3 with pid 31035 completed with status 0
% 0.22/0.53 # Result found by post_as_ho3
% 0.22/0.53 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.53 # Starting post_as_ho3 with 300s (1) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGUNM-FFMF32-SHSSMFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.53 # new_ho_10 with pid 31044 completed with status 0
% 0.22/0.53 # Result found by new_ho_10
% 0.22/0.53 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.53 # Starting post_as_ho3 with 300s (1) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGUNM-FFMF32-SHSSMFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.53 # Preprocessing time : 0.004 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 118
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 91
% 0.22/0.53 # Removed in clause preprocessing : 45
% 0.22/0.53 # Initial clauses in saturation : 46
% 0.22/0.53 # Processed clauses : 109
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 5
% 0.22/0.53 # ...remaining for further processing : 104
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 12
% 0.22/0.53 # Generated clauses : 132
% 0.22/0.53 # ...of the previous two non-redundant : 115
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 132
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 35
% 0.22/0.53 # ...of those cached : 11
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 48
% 0.22/0.53 # Positive orientable unit clauses : 17
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 0
% 0.22/0.53 # Non-unit-clauses : 31
% 0.22/0.53 # Current number of unprocessed clauses: 89
% 0.22/0.53 # ...number of literals in the above : 200
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 56
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 203
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 154
% 0.22/0.53 # Non-unit clause-clause subsumptions : 5
% 0.22/0.53 # Unit Clause-clause subsumption calls : 33
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 24
% 0.22/0.53 # BW rewrite match successes : 11
% 0.22/0.53 # Condensation attempts : 109
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 10068
% 0.22/0.53 # Search garbage collected termcells : 3139
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.013 s
% 0.22/0.53 # System time : 0.007 s
% 0.22/0.53 # Total time : 0.020 s
% 0.22/0.53 # Maximum resident set size: 2416 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.016 s
% 0.22/0.53 # System time : 0.009 s
% 0.22/0.53 # Total time : 0.025 s
% 0.22/0.53 # Maximum resident set size: 1828 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------