TSTP Solution File: AGT037^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : AGT037^2 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:48 EDT 2024
% Result : Theorem 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 28
% Syntax : Number of formulae : 53 ( 23 unt; 17 typ; 0 def)
% Number of atoms : 83 ( 16 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 185 ( 30 ~; 19 |; 1 &; 135 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 73 ( 73 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 75 ( 40 ^ 35 !; 0 ?; 75 :)
% 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_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
a1: $i > $i > $o ).
thf(decl_56,type,
jan: mu ).
thf(decl_57,type,
piotr: mu ).
thf(decl_58,type,
cola: mu ).
thf(decl_60,type,
beer: mu ).
thf(decl_61,type,
likes: mu > mu > $i > $o ).
thf(decl_63,type,
possibly_likes: mu > mu > $i > $o ).
thf(decl_65,type,
esk2_1: $i > $i ).
thf(decl_69,type,
esk6_0: $i ).
thf(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mdia) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(axiom_a1_1,axiom,
mvalid @ ( mbox @ a1 @ ( likes @ jan @ cola ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_a1_1) ).
thf(axiom_a3_3,axiom,
mvalid @ ( mdia @ a1 @ ( likes @ piotr @ beer ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_a3_3) ).
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/sandbox/benchmark/theBenchmark.p',axiom_user_communication_3) ).
thf(conj,conjecture,
mvalid @ ( possibly_likes @ jan @ cola ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_11,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X20: $i] :
( ~ ( Z0 @ Z2 @ X20 )
| ~ ( Z1 @ X20 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,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_14,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_15,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_16,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_17,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X20: $i] :
( ~ ( Z0 @ Z2 @ X20 )
| ~ ( Z1 @ X20 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_18,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_14,c_0_12]),c_0_15]) ).
thf(c_0_19,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_20,plain,
! [X22: $i,X21: $i] :
( ~ ( a1 @ X22 @ X21 )
| ( likes @ jan @ cola @ X21 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_a1_1,c_0_13]),c_0_16])]) ).
thf(c_0_21,plain,
! [X50: $i] :
~ ! [X49: $i] :
( ~ ( a1 @ X50 @ X49 )
| ~ ( likes @ piotr @ beer @ X49 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_a3_3,c_0_17]),c_0_16])]) ).
thf(c_0_22,plain,
! [X68: $i,X67: mu,X66: mu] :
( ~ ~ ! [X65: $i] :
( ~ ( a1 @ X68 @ X65 )
| ~ ( likes @ X67 @ X66 @ X65 ) )
| ( possibly_likes @ X67 @ X66 @ X68 ) ),
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_18]),c_0_19]),c_0_17]),c_0_16])]) ).
thf(c_0_23,plain,
! [X78: $i,X79: $i] :
( ~ ( a1 @ X78 @ X79 )
| ( likes @ jan @ cola @ X79 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_20])]) ).
thf(c_0_24,plain,
! [X106: $i] :
( ( a1 @ X106 @ ( esk2_1 @ X106 ) )
& ( likes @ piotr @ beer @ ( esk2_1 @ X106 ) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
thf(c_0_25,plain,
! [X122: $i,X123: mu,X124: mu,X125: $i] :
( ~ ( a1 @ X122 @ X125 )
| ~ ( likes @ X123 @ X124 @ X125 )
| ( possibly_likes @ X123 @ X124 @ X122 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
thf(c_0_26,plain,
! [X3: $i,X14: $i] :
( ( likes @ jan @ cola @ X14 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,plain,
! [X3: $i] : ( a1 @ X3 @ ( esk2_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,negated_conjecture,
~ ! [X77: $i] : ( possibly_likes @ jan @ cola @ X77 ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_16]) ).
thf(c_0_29,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_25]) ).
thf(c_0_30,plain,
! [X3: $i] : ( likes @ jan @ cola @ ( esk2_1 @ X3 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_31,negated_conjecture,
~ ( possibly_likes @ jan @ cola @ esk6_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
thf(c_0_32,plain,
! [X3: $i,X14: $i] :
( ( possibly_likes @ jan @ cola @ X3 )
| ~ ( a1 @ X3 @ ( esk2_1 @ X14 ) ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_33,negated_conjecture,
~ ( possibly_likes @ jan @ cola @ esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_34,plain,
! [X3: $i] : ( possibly_likes @ jan @ cola @ X3 ),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
thf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : AGT037^2 : TPTP v8.2.0. Released v5.2.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.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 18:49:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.50 Running higher-order theorem proving
% 0.19/0.50 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.53 # Version: 3.1.0-ho
% 0.19/0.53 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.53 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.53 # Starting new_ho_12 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_2 with 300s (1) cores
% 0.19/0.53 # post_as_ho3 with pid 30730 completed with status 0
% 0.19/0.53 # Result found by post_as_ho3
% 0.19/0.53 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.53 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.53 # No SInE strategy applied
% 0.19/0.53 # Search class: HGUNM-FFMF32-SHSSMFNN
% 0.19/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.53 # new_ho_10 with pid 30734 completed with status 0
% 0.19/0.53 # Result found by new_ho_10
% 0.19/0.53 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.53 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.53 # No SInE strategy applied
% 0.19/0.53 # Search class: HGUNM-FFMF32-SHSSMFNN
% 0.19/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.53 # Preprocessing time : 0.003 s
% 0.19/0.53 # Presaturation interreduction done
% 0.19/0.53
% 0.19/0.53 # Proof found!
% 0.19/0.53 # SZS status Theorem
% 0.19/0.53 # SZS output start CNFRefutation
% See solution above
% 0.19/0.53 # Parsed axioms : 93
% 0.19/0.53 # Removed by relevancy pruning/SinE : 0
% 0.19/0.53 # Initial clauses : 68
% 0.19/0.53 # Removed in clause preprocessing : 43
% 0.19/0.53 # Initial clauses in saturation : 25
% 0.19/0.53 # Processed clauses : 50
% 0.19/0.53 # ...of these trivial : 0
% 0.19/0.53 # ...subsumed : 0
% 0.19/0.53 # ...remaining for further processing : 50
% 0.19/0.53 # Other redundant clauses eliminated : 0
% 0.19/0.53 # Clauses deleted for lack of memory : 0
% 0.19/0.53 # Backward-subsumed : 0
% 0.19/0.53 # Backward-rewritten : 3
% 0.19/0.53 # Generated clauses : 22
% 0.19/0.53 # ...of the previous two non-redundant : 20
% 0.19/0.53 # ...aggressively subsumed : 0
% 0.19/0.53 # Contextual simplify-reflections : 0
% 0.19/0.53 # Paramodulations : 22
% 0.19/0.53 # Factorizations : 0
% 0.19/0.53 # NegExts : 0
% 0.19/0.53 # Equation resolutions : 0
% 0.19/0.53 # Disequality decompositions : 0
% 0.19/0.53 # Total rewrite steps : 4
% 0.19/0.53 # ...of those cached : 0
% 0.19/0.53 # Propositional unsat checks : 0
% 0.19/0.53 # Propositional check models : 0
% 0.19/0.53 # Propositional check unsatisfiable : 0
% 0.19/0.53 # Propositional clauses : 0
% 0.19/0.53 # Propositional clauses after purity: 0
% 0.19/0.53 # Propositional unsat core size : 0
% 0.19/0.53 # Propositional preprocessing time : 0.000
% 0.19/0.53 # Propositional encoding time : 0.000
% 0.19/0.53 # Propositional solver time : 0.000
% 0.19/0.53 # Success case prop preproc time : 0.000
% 0.19/0.53 # Success case prop encoding time : 0.000
% 0.19/0.53 # Success case prop solver time : 0.000
% 0.19/0.53 # Current number of processed clauses : 22
% 0.19/0.53 # Positive orientable unit clauses : 10
% 0.19/0.53 # Positive unorientable unit clauses: 0
% 0.19/0.53 # Negative unit clauses : 0
% 0.19/0.53 # Non-unit-clauses : 12
% 0.19/0.53 # Current number of unprocessed clauses: 20
% 0.19/0.53 # ...number of literals in the above : 58
% 0.19/0.53 # Current number of archived formulas : 0
% 0.19/0.53 # Current number of archived clauses : 28
% 0.19/0.53 # Clause-clause subsumption calls (NU) : 57
% 0.19/0.53 # Rec. Clause-clause subsumption calls : 6
% 0.19/0.53 # Non-unit clause-clause subsumptions : 0
% 0.19/0.53 # Unit Clause-clause subsumption calls : 6
% 0.19/0.53 # Rewrite failures with RHS unbound : 0
% 0.19/0.53 # BW rewrite match attempts : 9
% 0.19/0.53 # BW rewrite match successes : 3
% 0.19/0.53 # Condensation attempts : 50
% 0.19/0.53 # Condensation successes : 0
% 0.19/0.53 # Termbank termtop insertions : 6844
% 0.19/0.53 # Search garbage collected termcells : 2548
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.011 s
% 0.19/0.53 # System time : 0.003 s
% 0.19/0.53 # Total time : 0.014 s
% 0.19/0.53 # Maximum resident set size: 2352 pages
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.012 s
% 0.19/0.53 # System time : 0.007 s
% 0.19/0.53 # Total time : 0.019 s
% 0.19/0.53 # Maximum resident set size: 1812 pages
% 0.19/0.53 % E---3.1 exiting
% 0.19/0.53 % E exiting
%------------------------------------------------------------------------------