TSTP Solution File: CSR137^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR137^2 : TPTP v8.2.0. Released v4.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:16:39 EDT 2024
% Result : Theorem 0.24s 0.55s
% Output : CNFRefutation 0.24s
% 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_30,type,
lAnna_THFTYPE_i: $i ).
thf(decl_33,type,
lBill_THFTYPE_i: $i ).
thf(decl_35,type,
lBob_THFTYPE_i: $i ).
thf(decl_36,type,
lMary_THFTYPE_i: $i ).
thf(decl_38,type,
lSue_THFTYPE_i: $i ).
thf(decl_39,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_42,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(con,conjecture,
? [X24: $i > $i > $o,X25: $i > $i > $o,X2: $i] :
( ( X25 @ X2 @ lBill_THFTYPE_i )
& ( X24 @ X2 @ lAnna_THFTYPE_i )
& ~ ! [X26: $i,X27: $i] : ( X25 @ X26 @ X27 )
& ~ ! [X26: $i,X27: $i] : ( X24 @ X26 @ X27 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(ax_002,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).
thf(ax_012,axiom,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_012) ).
thf(ax_025,axiom,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_025) ).
thf(ax,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(c_0_5,negated_conjecture,
~ ? [X24: $i > $i > $o,X25: $i > $i > $o,X2: $i] :
( ( X25 @ X2 @ lBill_THFTYPE_i )
& ( X24 @ X2 @ lAnna_THFTYPE_i )
& ~ ! [X26: $i,X27: $i] : ( X25 @ X26 @ X27 )
& ~ ! [X26: $i,X27: $i] : ( X24 @ X26 @ X27 ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_6,negated_conjecture,
! [X65: $i > $i > $o,X66: $i > $i > $o,X67: $i,X68: $i,X69: $i,X70: $i,X71: $i] :
( ~ ( X66 @ X67 @ lBill_THFTYPE_i )
| ~ ( X65 @ X67 @ lAnna_THFTYPE_i )
| ( X66 @ X68 @ X69 )
| ( X65 @ X70 @ X71 ) ),
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_002]) ).
thf(c_0_8,negated_conjecture,
! [X4: $i,X3: $i,X5: $i,X24: $i > $i > $o,X25: $i > $i > $o,X2: $i,X1: $i] :
( ( X24 @ X2 @ X3 )
| ( X25 @ X4 @ X5 )
| ~ ( X24 @ X1 @ lBill_THFTYPE_i )
| ~ ( X25 @ X1 @ 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_012]) ).
thf(c_0_10,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(fof_simplification,[status(thm)],[ax_025]) ).
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,
! [X1: $i,X2: $i,X3: $i,X4: $i,X24: $i > $i > $o] :
( ( parent_THFTYPE_IiioI @ X1 @ X2 )
| ( X24 @ X3 @ X4 )
| ~ ( X24 @ 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,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( likes_THFTYPE_IiioI @ X1 @ X2 )
| ( parent_THFTYPE_IiioI @ X3 @ X4 ) ),
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,
! [X1: $i,X2: $i] : ( parent_THFTYPE_IiioI @ X1 @ X2 ),
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.09/0.14 % Problem : CSR137^2 : TPTP v8.2.0. Released v4.1.0.
% 0.09/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n018.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Sun May 19 02:24:08 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.24/0.53 Running higher-order theorem proving
% 0.24/0.53 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.55 # Version: 3.1.0-ho
% 0.24/0.55 # Preprocessing class: HSMSSMSMSSSNSSA.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.55 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.24/0.55 # Starting sh5l with 300s (1) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # sh5l with pid 2686 completed with status 0
% 0.24/0.55 # Result found by sh5l
% 0.24/0.55 # Preprocessing class: HSMSSMSMSSSNSSA.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.55 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.24/0.55 # Starting sh5l with 300s (1) cores
% 0.24/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.55 # Search class: HGHNF-FFMM11-SSSFFFBN
% 0.24/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 # Starting new_ho_10 with 181s (1) cores
% 0.24/0.55 # new_ho_10 with pid 2692 completed with status 0
% 0.24/0.55 # Result found by new_ho_10
% 0.24/0.55 # Preprocessing class: HSMSSMSMSSSNSSA.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.55 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.24/0.55 # Starting sh5l with 300s (1) cores
% 0.24/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.55 # Search class: HGHNF-FFMM11-SSSFFFBN
% 0.24/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 # Starting new_ho_10 with 181s (1) cores
% 0.24/0.55 # Preprocessing time : 0.001 s
% 0.24/0.55 # Presaturation interreduction done
% 0.24/0.55
% 0.24/0.55 # Proof found!
% 0.24/0.55 # SZS status Theorem
% 0.24/0.55 # SZS output start CNFRefutation
% See solution above
% 0.24/0.55 # Parsed axioms : 71
% 0.24/0.55 # Removed by relevancy pruning/SinE : 28
% 0.24/0.55 # Initial clauses : 48
% 0.24/0.55 # Removed in clause preprocessing : 5
% 0.24/0.55 # Initial clauses in saturation : 43
% 0.24/0.55 # Processed clauses : 83
% 0.24/0.55 # ...of these trivial : 7
% 0.24/0.55 # ...subsumed : 5
% 0.24/0.55 # ...remaining for further processing : 71
% 0.24/0.55 # Other redundant clauses eliminated : 0
% 0.24/0.55 # Clauses deleted for lack of memory : 0
% 0.24/0.55 # Backward-subsumed : 1
% 0.24/0.55 # Backward-rewritten : 10
% 0.24/0.55 # Generated clauses : 16
% 0.24/0.55 # ...of the previous two non-redundant : 16
% 0.24/0.55 # ...aggressively subsumed : 0
% 0.24/0.55 # Contextual simplify-reflections : 0
% 0.24/0.55 # Paramodulations : 16
% 0.24/0.55 # Factorizations : 0
% 0.24/0.55 # NegExts : 0
% 0.24/0.55 # Equation resolutions : 0
% 0.24/0.55 # Disequality decompositions : 0
% 0.24/0.55 # Total rewrite steps : 12
% 0.24/0.55 # ...of those cached : 0
% 0.24/0.55 # Propositional unsat checks : 0
% 0.24/0.55 # Propositional check models : 0
% 0.24/0.55 # Propositional check unsatisfiable : 0
% 0.24/0.55 # Propositional clauses : 0
% 0.24/0.55 # Propositional clauses after purity: 0
% 0.24/0.55 # Propositional unsat core size : 0
% 0.24/0.55 # Propositional preprocessing time : 0.000
% 0.24/0.55 # Propositional encoding time : 0.000
% 0.24/0.55 # Propositional solver time : 0.000
% 0.24/0.55 # Success case prop preproc time : 0.000
% 0.24/0.55 # Success case prop encoding time : 0.000
% 0.24/0.55 # Success case prop solver time : 0.000
% 0.24/0.55 # Current number of processed clauses : 29
% 0.24/0.55 # Positive orientable unit clauses : 16
% 0.24/0.55 # Positive unorientable unit clauses: 0
% 0.24/0.55 # Negative unit clauses : 1
% 0.24/0.55 # Non-unit-clauses : 12
% 0.24/0.55 # Current number of unprocessed clauses: 6
% 0.24/0.55 # ...number of literals in the above : 20
% 0.24/0.55 # Current number of archived formulas : 0
% 0.24/0.55 # Current number of archived clauses : 42
% 0.24/0.55 # Clause-clause subsumption calls (NU) : 58
% 0.24/0.55 # Rec. Clause-clause subsumption calls : 46
% 0.24/0.55 # Non-unit clause-clause subsumptions : 3
% 0.24/0.55 # Unit Clause-clause subsumption calls : 5
% 0.24/0.55 # Rewrite failures with RHS unbound : 0
% 0.24/0.55 # BW rewrite match attempts : 11
% 0.24/0.55 # BW rewrite match successes : 10
% 0.24/0.55 # Condensation attempts : 83
% 0.24/0.55 # Condensation successes : 1
% 0.24/0.55 # Termbank termtop insertions : 2981
% 0.24/0.55 # Search garbage collected termcells : 502
% 0.24/0.55
% 0.24/0.55 # -------------------------------------------------
% 0.24/0.55 # User time : 0.009 s
% 0.24/0.55 # System time : 0.001 s
% 0.24/0.55 # Total time : 0.010 s
% 0.24/0.55 # Maximum resident set size: 1924 pages
% 0.24/0.55
% 0.24/0.55 # -------------------------------------------------
% 0.24/0.55 # User time : 0.012 s
% 0.24/0.55 # System time : 0.003 s
% 0.24/0.55 # Total time : 0.015 s
% 0.24/0.55 # Maximum resident set size: 1780 pages
% 0.24/0.55 % E---3.1 exiting
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------