TSTP Solution File: CSR142^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR142^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Sat May 4 07:34:39 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 20 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 67 ( 11 ~; 7 |; 1 &; 46 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 17 !; 2 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
husband_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_23,type,
lChris_THFTYPE_i: $i ).
thf(decl_24,type,
lCorina_THFTYPE_i: $i ).
thf(decl_25,type,
wife_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_26,type,
inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(con,conjecture,
? [X5: $i] : ( husband_THFTYPE_IiioI @ X5 @ lCorina_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.Zo6q9fOh9H/E---3.1_3915.p',con) ).
thf(ax_001,axiom,
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ( inverse_THFTYPE_IIiioIIiioIoI @ X2 @ X1 )
=> ! [X3: $i,X4: $i] :
( ( X2 @ X3 @ X4 )
<=> ( X1 @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Zo6q9fOh9H/E---3.1_3915.p',ax_001) ).
thf(ax,axiom,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
file('/export/starexec/sandbox/tmp/tmp.Zo6q9fOh9H/E---3.1_3915.p',ax) ).
thf(ax_002,axiom,
wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
file('/export/starexec/sandbox/tmp/tmp.Zo6q9fOh9H/E---3.1_3915.p',ax_002) ).
thf(c_0_4,negated_conjecture,
~ ? [X5: $i] : ( husband_THFTYPE_IiioI @ X5 @ lCorina_THFTYPE_i ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_5,plain,
! [X11: $i > $i > $o,X12: $i > $i > $o,X13: $i,X14: $i] :
( ( ~ ( X12 @ X13 @ X14 )
| ( X11 @ X14 @ X13 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X12 @ X11 ) )
& ( ~ ( X11 @ X14 @ X13 )
| ( X12 @ X13 @ X14 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X12 @ X11 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_001])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X15: $i] :
~ ( husband_THFTYPE_IiioI @ X15 @ lCorina_THFTYPE_i ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_7,plain,
! [X4: $i,X3: $i,X2: $i > $i > $o,X1: $i > $i > $o] :
( ( X2 @ X4 @ X3 )
| ~ ( X1 @ X3 @ X4 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
inference(split_conjunct,[status(thm)],[ax]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i] :
~ ( husband_THFTYPE_IiioI @ X3 @ lCorina_THFTYPE_i ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X4: $i,X3: $i] :
( ( husband_THFTYPE_IiioI @ X3 @ X4 )
| ~ ( wife_THFTYPE_IiioI @ X4 @ X3 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_002]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i] :
~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ X3 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : CSR142^1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.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 : Fri May 3 15:10:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 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/tmp/tmp.Zo6q9fOh9H/E---3.1_3915.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_14 with 1500s (5) cores
% 0.20/0.50 # Starting full_lambda_8 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_13 with 300s (1) cores
% 0.20/0.50 # Starting ho_unfolding_3 with 300s (1) cores
% 0.20/0.50 # ho_unfolding_3 with pid 3998 completed with status 0
% 0.20/0.50 # Result found by ho_unfolding_3
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_14 with 1500s (5) cores
% 0.20/0.50 # Starting full_lambda_8 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_13 with 300s (1) cores
% 0.20/0.50 # Starting ho_unfolding_3 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHUNF-FFSF00-SSFFFSBN
% 0.20/0.50 # partial match(1): HHUNF-FFSF00-SSSFFSBN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 181s (1) cores
% 0.20/0.50 # ho_unfolding_3 with pid 4006 completed with status 0
% 0.20/0.50 # Result found by ho_unfolding_3
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_14 with 1500s (5) cores
% 0.20/0.50 # Starting full_lambda_8 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_13 with 300s (1) cores
% 0.20/0.50 # Starting ho_unfolding_3 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHUNF-FFSF00-SSFFFSBN
% 0.20/0.50 # partial match(1): HHUNF-FFSF00-SSSFFSBN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 10
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 11
% 0.20/0.50 # Removed in clause preprocessing : 6
% 0.20/0.50 # Initial clauses in saturation : 5
% 0.20/0.50 # Processed clauses : 13
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 13
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 5
% 0.20/0.50 # ...of the previous two non-redundant : 3
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 4
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 7
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 4
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 6
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 4
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 4
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 13
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 482
% 0.20/0.50 # Search garbage collected termcells : 75
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1768 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1720 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------