TSTP Solution File: DAT334^8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : DAT334^8 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 19:47:17 EDT 2024
% Result : Theorem 0.24s 0.53s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 38 ( 12 unt; 17 typ; 0 def)
% Number of atoms : 66 ( 8 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 163 ( 13 ~; 9 |; 14 &; 123 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 31 ( 18 ^ 9 !; 4 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_22,type,
mrel: mworld > mworld > $o ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_26,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
eiw_di: $i > mworld > $o ).
thf(decl_34,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_35,type,
cs: $i ).
thf(decl_36,type,
sue: $i ).
thf(decl_37,type,
mary: $i ).
thf(decl_38,type,
john: $i ).
thf(decl_39,type,
math: $i ).
thf(decl_40,type,
psych: $i ).
thf(decl_41,type,
teach: $i > $i > mworld > $o ).
thf(decl_43,type,
esk2_1: mworld > $i ).
thf(decl_44,type,
esk3_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
? [X6: $i] :
( ( eiw_di @ X6 @ X3 )
& ( X8 @ X6 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mexists_di_def) ).
thf(db,axiom,
( mlocal
@ ( mbox
@ ( mand @ ( teach @ john @ math )
@ ( mand
@ ( mexists_di
@ ^ [X6: $i] : ( teach @ X6 @ cs ) )
@ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',db) ).
thf(query,conjecture,
( mlocal
@ ( mbox
@ ( mexists_di
@ ^ [X6: $i] : ( teach @ X6 @ cs ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query) ).
thf(c_0_6,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_7,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_8,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_9,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X6: $i] :
( ( eiw_di @ X6 @ Z1 )
& ( Z0 @ X6 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_10,plain,
! [X13: mworld] :
( ( mrel @ mactual @ X13 )
=> ( ( teach @ john @ math @ X13 )
& ? [X12: $i] :
( ( eiw_di @ X12 @ X13 )
& ( teach @ X12 @ cs @ X13 ) )
& ( teach @ mary @ psych @ X13 )
& ( teach @ sue @ psych @ X13 ) ) ),
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)],[db]),c_0_6]),c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
~ ! [X15: mworld] :
( ( mrel @ mactual @ X15 )
=> ? [X14: $i] :
( ( eiw_di @ X14 @ X15 )
& ( teach @ X14 @ cs @ X15 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query])]),c_0_6]),c_0_8]),c_0_9]) ).
thf(c_0_12,plain,
! [X19: mworld] :
( ( ( teach @ john @ math @ X19 )
| ~ ( mrel @ mactual @ X19 ) )
& ( ( eiw_di @ ( esk2_1 @ X19 ) @ X19 )
| ~ ( mrel @ mactual @ X19 ) )
& ( ( teach @ ( esk2_1 @ X19 ) @ cs @ X19 )
| ~ ( mrel @ mactual @ X19 ) )
& ( ( teach @ mary @ psych @ X19 )
| ~ ( mrel @ mactual @ X19 ) )
& ( ( teach @ sue @ psych @ X19 )
| ~ ( mrel @ mactual @ X19 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
thf(c_0_13,negated_conjecture,
! [X22: $i] :
( ( mrel @ mactual @ esk3_0 )
& ( ~ ( eiw_di @ X22 @ esk3_0 )
| ~ ( teach @ X22 @ cs @ esk3_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_11])])])])]) ).
thf(c_0_14,plain,
! [X3: mworld] :
( ( eiw_di @ ( esk2_1 @ X3 ) @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
mrel @ mactual @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X6: $i] :
( ~ ( eiw_di @ X6 @ esk3_0 )
| ~ ( teach @ X6 @ cs @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
eiw_di @ ( esk2_1 @ esk3_0 ) @ esk3_0,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
! [X3: mworld] :
( ( teach @ ( esk2_1 @ X3 ) @ cs @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
~ ( teach @ ( esk2_1 @ esk3_0 ) @ cs @ esk3_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : DAT334^8 : TPTP v8.2.0. Released v8.1.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n018.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sun May 19 23:18:23 EDT 2024
% 0.16/0.39 % CPUTime :
% 0.24/0.52 Running higher-order theorem proving
% 0.24/0.52 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.24/0.53 # Version: 3.1.0-ho
% 0.24/0.53 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.24/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.53 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.24/0.53 # Starting almost_fo_3_lam with 300s (1) cores
% 0.24/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.24/0.53 # ho_unfolding_3 with pid 30668 completed with status 0
% 0.24/0.53 # Result found by ho_unfolding_3
% 0.24/0.53 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.24/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.53 # No SInE strategy applied
% 0.24/0.53 # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.24/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.53 # Starting new_ho_10 with 811s (1) cores
% 0.24/0.53 # Starting ho_unfolding_3 with 151s (1) cores
% 0.24/0.53 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.24/0.53 # Starting lpo1_def_fix with 136s (1) cores
% 0.24/0.53 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.24/0.53 # ehoh_best8_lambda with pid 30676 completed with status 0
% 0.24/0.53 # Result found by ehoh_best8_lambda
% 0.24/0.53 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.24/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.53 # No SInE strategy applied
% 0.24/0.53 # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.24/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.53 # Starting new_ho_10 with 811s (1) cores
% 0.24/0.53 # Starting ho_unfolding_3 with 151s (1) cores
% 0.24/0.53 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.24/0.53 # Starting lpo1_def_fix with 136s (1) cores
% 0.24/0.53 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.24/0.53 # Preprocessing time : 0.001 s
% 0.24/0.53 # Presaturation interreduction done
% 0.24/0.53
% 0.24/0.53 # Proof found!
% 0.24/0.53 # SZS status Theorem
% 0.24/0.53 # SZS output start CNFRefutation
% See solution above
% 0.24/0.53 # Parsed axioms : 35
% 0.24/0.53 # Removed by relevancy pruning/SinE : 0
% 0.24/0.53 # Initial clauses : 30
% 0.24/0.53 # Removed in clause preprocessing : 21
% 0.24/0.53 # Initial clauses in saturation : 9
% 0.24/0.53 # Processed clauses : 22
% 0.24/0.53 # ...of these trivial : 0
% 0.24/0.53 # ...subsumed : 0
% 0.24/0.53 # ...remaining for further processing : 22
% 0.24/0.53 # Other redundant clauses eliminated : 0
% 0.24/0.53 # Clauses deleted for lack of memory : 0
% 0.24/0.53 # Backward-subsumed : 0
% 0.24/0.53 # Backward-rewritten : 0
% 0.24/0.53 # Generated clauses : 12
% 0.24/0.53 # ...of the previous two non-redundant : 11
% 0.24/0.53 # ...aggressively subsumed : 0
% 0.24/0.53 # Contextual simplify-reflections : 0
% 0.24/0.53 # Paramodulations : 12
% 0.24/0.53 # Factorizations : 0
% 0.24/0.53 # NegExts : 0
% 0.24/0.53 # Equation resolutions : 0
% 0.24/0.53 # Disequality decompositions : 0
% 0.24/0.53 # Total rewrite steps : 0
% 0.24/0.53 # ...of those cached : 0
% 0.24/0.53 # Propositional unsat checks : 0
% 0.24/0.53 # Propositional check models : 0
% 0.24/0.53 # Propositional check unsatisfiable : 0
% 0.24/0.53 # Propositional clauses : 0
% 0.24/0.53 # Propositional clauses after purity: 0
% 0.24/0.53 # Propositional unsat core size : 0
% 0.24/0.53 # Propositional preprocessing time : 0.000
% 0.24/0.53 # Propositional encoding time : 0.000
% 0.24/0.53 # Propositional solver time : 0.000
% 0.24/0.53 # Success case prop preproc time : 0.000
% 0.24/0.53 # Success case prop encoding time : 0.000
% 0.24/0.53 # Success case prop solver time : 0.000
% 0.24/0.53 # Current number of processed clauses : 13
% 0.24/0.53 # Positive orientable unit clauses : 5
% 0.24/0.53 # Positive unorientable unit clauses: 0
% 0.24/0.53 # Negative unit clauses : 2
% 0.24/0.53 # Non-unit-clauses : 6
% 0.24/0.53 # Current number of unprocessed clauses: 6
% 0.24/0.53 # ...number of literals in the above : 6
% 0.24/0.53 # Current number of archived formulas : 0
% 0.24/0.53 # Current number of archived clauses : 9
% 0.24/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.24/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.24/0.53 # Non-unit clause-clause subsumptions : 0
% 0.24/0.53 # Unit Clause-clause subsumption calls : 3
% 0.24/0.53 # Rewrite failures with RHS unbound : 0
% 0.24/0.53 # BW rewrite match attempts : 1
% 0.24/0.53 # BW rewrite match successes : 0
% 0.24/0.53 # Condensation attempts : 0
% 0.24/0.53 # Condensation successes : 0
% 0.24/0.53 # Termbank termtop insertions : 1403
% 0.24/0.53 # Search garbage collected termcells : 225
% 0.24/0.53
% 0.24/0.53 # -------------------------------------------------
% 0.24/0.53 # User time : 0.003 s
% 0.24/0.53 # System time : 0.002 s
% 0.24/0.53 # Total time : 0.005 s
% 0.24/0.53 # Maximum resident set size: 1832 pages
% 0.24/0.53
% 0.24/0.53 # -------------------------------------------------
% 0.24/0.53 # User time : 0.010 s
% 0.24/0.53 # System time : 0.008 s
% 0.24/0.53 # Total time : 0.019 s
% 0.24/0.53 # Maximum resident set size: 1756 pages
% 0.24/0.53 % E---3.1 exiting
% 0.24/0.54 % E exiting
%------------------------------------------------------------------------------