TSTP Solution File: CSR139^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR139^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:40 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 19 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 17 ( 6 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 53 ( 12 ~; 5 |; 4 &; 32 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 17 ( 2 ^ 9 !; 6 ?; 17 :)
% 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_27,type,
lSue_THFTYPE_i: $i ).
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 )
& ( X2 != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
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(c_0_3,negated_conjecture,
~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ( X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_4,negated_conjecture,
! [X7: $i > $i > $o,X8: $i > $i > $o,X9: $i] :
( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
| ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
| ( X8 = X7 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( ( X1 = X2 )
| ~ ( X1 @ X3 @ lBill_THFTYPE_i )
| ~ ( X2 @ X3 @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_007]) ).
thf(c_0_7,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(fof_simplification,[status(thm)],[ax_009]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 = parent_THFTYPE_IiioI )
| ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
( ( ^ [Z0: $i,Z1: $i] : $true )
= parent_THFTYPE_IiioI ),
inference(er,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X6: $i] : ( parent_THFTYPE_IiioI @ X3 @ X6 ),
inference(arg_cong,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR139^1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:16:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/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.20/0.51 # Version: 3.1.0-ho
% 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.51 # post_as_ho12 with pid 15329 completed with status 0
% 0.20/0.51 # Result found by post_as_ho12
% 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HHUSF-FFSM00-SSSFFFBN
% 0.20/0.51 # partial match(1): HHUNF-FFSM00-SSSFFFBN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.51 # new_ho_10 with pid 15337 completed with status 9
% 0.20/0.51 # Starting post_as_ho12 with 31s (1) cores
% 0.20/0.51 # post_as_ho12 with pid 15345 completed with status 0
% 0.20/0.51 # Result found by post_as_ho12
% 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HHUSF-FFSM00-SSSFFFBN
% 0.20/0.51 # partial match(1): HHUNF-FFSM00-SSSFFFBN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.51 # new_ho_10 with pid 15337 completed with status 9
% 0.20/0.51 # Starting post_as_ho12 with 31s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 20
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 20
% 0.20/0.51 # Removed in clause preprocessing : 9
% 0.20/0.51 # Initial clauses in saturation : 11
% 0.20/0.51 # Processed clauses : 32
% 0.20/0.51 # ...of these trivial : 1
% 0.20/0.51 # ...subsumed : 1
% 0.20/0.51 # ...remaining for further processing : 30
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 6
% 0.20/0.51 # Generated clauses : 45
% 0.20/0.51 # ...of the previous two non-redundant : 33
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 12
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 5
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 5
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 13
% 0.20/0.51 # Positive orientable unit clauses : 7
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 5
% 0.20/0.51 # Current number of unprocessed clauses: 23
% 0.20/0.51 # ...number of literals in the above : 49
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 17
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 10
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 6
% 0.20/0.51 # Non-unit clause-clause subsumptions : 1
% 0.20/0.51 # Unit Clause-clause subsumption calls : 2
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 9
% 0.20/0.51 # BW rewrite match successes : 6
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 1863
% 0.20/0.51 # Search garbage collected termcells : 55
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.014 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.018 s
% 0.20/0.51 # Maximum resident set size: 1784 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.016 s
% 0.20/0.51 # System time : 0.006 s
% 0.20/0.51 # Total time : 0.022 s
% 0.20/0.51 # Maximum resident set size: 1716 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------