TSTP Solution File: CSR137^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR137^1 : TPTP v8.2.0. Released v4.1.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 19:16:39 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 27 ( 15 unt; 7 typ; 0 def)
% Number of atoms : 17 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 0 avg)
% Number of connectives : 101 ( 18 ~; 9 |; 6 &; 68 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 39 ( 0 ^ 33 !; 6 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
lAnna_THFTYPE_i: $i ).
thf(decl_24,type,
lBill_THFTYPE_i: $i ).
thf(decl_25,type,
lBob_THFTYPE_i: $i ).
thf(decl_26,type,
lMary_THFTYPE_i: $i ).
thf(decl_27,type,
lSue_THFTYPE_i: $i ).
thf(decl_28,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_29,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(con,conjecture,
? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ~ ! [X4: $i,X5: $i] : ( X2 @ X4 @ X5 )
& ~ ! [X4: $i,X5: $i] : ( X1 @ X4 @ X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(ax_001,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001) ).
thf(ax_007,axiom,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_007) ).
thf(ax_009,axiom,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_009) ).
thf(ax,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).
thf(c_0_5,negated_conjecture,
~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ~ ! [X4: $i,X5: $i] : ( X2 @ X4 @ X5 )
& ~ ! [X4: $i,X5: $i] : ( X1 @ X4 @ X5 ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_6,negated_conjecture,
! [X13: $i > $i > $o,X14: $i > $i > $o,X15: $i,X16: $i,X17: $i,X18: $i,X19: $i] :
( ~ ( X14 @ X15 @ lBill_THFTYPE_i )
| ~ ( X13 @ X15 @ lAnna_THFTYPE_i )
| ( X14 @ X16 @ X17 )
| ( X13 @ X18 @ X19 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
thf(c_0_7,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(fof_simplification,[status(thm)],[ax_001]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i > $i > $o,X2: $i > $i > $o,X5: $i,X9: $i,X8: $i,X4: $i,X3: $i] :
( ( X1 @ X4 @ X5 )
| ( X2 @ X8 @ X9 )
| ~ ( X1 @ X3 @ lBill_THFTYPE_i )
| ~ ( X2 @ X3 @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_007]) ).
thf(c_0_10,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(fof_simplification,[status(thm)],[ax_009]) ).
thf(c_0_11,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X4: $i,X3: $i,X8: $i,X5: $i,X1: $i > $i > $o] :
( ( parent_THFTYPE_IiioI @ X3 @ X4 )
| ( X1 @ X5 @ X8 )
| ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax]) ).
thf(c_0_14,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i,X4: $i,X5: $i,X8: $i] :
( ( likes_THFTYPE_IiioI @ X3 @ X4 )
| ( parent_THFTYPE_IiioI @ X5 @ X8 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X3: $i,X4: $i] : ( parent_THFTYPE_IiioI @ X3 @ X4 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_19,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR137^1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 01:15:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 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.49 # Version: 3.1.0-ho
% 0.21/0.49 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.49 # Starting new_ho_3 with 300s (1) cores
% 0.21/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.49 # post_as_ho12 with pid 11616 completed with status 0
% 0.21/0.49 # Result found by post_as_ho12
% 0.21/0.49 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: HGUNF-FFSM00-SSSFFFBN
% 0.21/0.49 # partial match(1): HHUNF-FFSM00-SSSFFFBN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.49 # new_ho_10 with pid 11621 completed with status 0
% 0.21/0.49 # Result found by new_ho_10
% 0.21/0.49 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: HGUNF-FFSM00-SSSFFFBN
% 0.21/0.49 # partial match(1): HHUNF-FFSM00-SSSFFFBN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 20
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 20
% 0.21/0.49 # Removed in clause preprocessing : 9
% 0.21/0.49 # Initial clauses in saturation : 11
% 0.21/0.49 # Processed clauses : 26
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 26
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 1
% 0.21/0.49 # Backward-rewritten : 8
% 0.21/0.49 # Generated clauses : 10
% 0.21/0.49 # ...of the previous two non-redundant : 9
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 10
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 3
% 0.21/0.49 # ...of those cached : 0
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 6
% 0.21/0.49 # Positive orientable unit clauses : 4
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 1
% 0.21/0.49 # Current number of unprocessed clauses: 5
% 0.21/0.49 # ...number of literals in the above : 16
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 20
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 6
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 6
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 3
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 8
% 0.21/0.49 # BW rewrite match successes : 8
% 0.21/0.49 # Condensation attempts : 26
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 855
% 0.21/0.49 # Search garbage collected termcells : 79
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.005 s
% 0.21/0.49 # System time : 0.001 s
% 0.21/0.49 # Total time : 0.006 s
% 0.21/0.49 # Maximum resident set size: 1760 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.006 s
% 0.21/0.49 # System time : 0.004 s
% 0.21/0.49 # Total time : 0.010 s
% 0.21/0.49 # Maximum resident set size: 1728 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------