TSTP Solution File: CSR150^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR150^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:46 EDT 2024
% Result : Theorem 0.23s 0.49s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 38 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 70 ( 1 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 223 ( 29 ~; 24 |; 6 &; 161 @)
% ( 2 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 7 ^ 40 !; 4 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
grandchild_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_23,type,
grandparent_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_24,type,
lCardinalityFn_THFTYPE_IIioIiI: ( $i > $o ) > $i ).
thf(decl_25,type,
lJohn_THFTYPE_i: $i ).
thf(decl_26,type,
ltet_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_27,type,
n3_THFTYPE_i: $i ).
thf(decl_28,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_29,type,
esk1_2: $i > $i > $i ).
thf(decl_30,type,
esk2_2: $i > $i > $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(con,conjecture,
? [X2: $i] :
( ltet_THFTYPE_IiioI
@ ( lCardinalityFn_THFTYPE_IIioIiI
@ ^ [X1: $i] : ( grandchild_THFTYPE_IiioI @ X1 @ lJohn_THFTYPE_i ) )
@ X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(ax_001,axiom,
( ltet_THFTYPE_IiioI
@ ( lCardinalityFn_THFTYPE_IIioIiI
@ ^ [X1: $i] : ( grandparent_THFTYPE_IiioI @ lJohn_THFTYPE_i @ X1 ) )
@ n3_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).
thf(ax,axiom,
! [X1: $i,X2: $i] :
( ( grandparent_THFTYPE_IiioI @ X1 @ X2 )
<=> ? [X3: $i] :
( ( parent_THFTYPE_IiioI @ X1 @ X3 )
& ( parent_THFTYPE_IiioI @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(ax_002,axiom,
! [X1: $i,X2: $i] :
( ( grandchild_THFTYPE_IiioI @ X1 @ X2 )
<=> ? [X3: $i] :
( ( parent_THFTYPE_IiioI @ X3 @ X1 )
& ( parent_THFTYPE_IiioI @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).
thf(c_0_4,negated_conjecture,
~ ? [X2: $i] :
( ltet_THFTYPE_IiioI
@ ( lCardinalityFn_THFTYPE_IIioIiI
@ ^ [Z0: $i] : ( grandchild_THFTYPE_IiioI @ Z0 @ lJohn_THFTYPE_i ) )
@ X2 ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_5,negated_conjecture,
! [X11: $i] :
~ ( ltet_THFTYPE_IiioI
@ ( lCardinalityFn_THFTYPE_IIioIiI
@ ^ [Z0: $i] : ( grandchild_THFTYPE_IiioI @ Z0 @ lJohn_THFTYPE_i ) )
@ X11 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_6,plain,
( ltet_THFTYPE_IiioI
@ ( lCardinalityFn_THFTYPE_IIioIiI
@ ^ [Z0: $i] : ( grandparent_THFTYPE_IiioI @ lJohn_THFTYPE_i @ Z0 ) )
@ n3_THFTYPE_i ),
inference(fof_simplification,[status(thm)],[ax_001]) ).
thf(c_0_7,plain,
! [X18: $i,X19: $i,X21: $i,X22: $i,X23: $i] :
( ( ( parent_THFTYPE_IiioI @ X18 @ ( esk2_2 @ X18 @ X19 ) )
| ~ ( grandparent_THFTYPE_IiioI @ X18 @ X19 ) )
& ( ( parent_THFTYPE_IiioI @ ( esk2_2 @ X18 @ X19 ) @ X19 )
| ~ ( grandparent_THFTYPE_IiioI @ X18 @ X19 ) )
& ( ~ ( parent_THFTYPE_IiioI @ X21 @ X23 )
| ~ ( parent_THFTYPE_IiioI @ X23 @ X22 )
| ( grandparent_THFTYPE_IiioI @ X21 @ X22 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ax])])])])])])]) ).
thf(c_0_8,plain,
! [X12: $i,X13: $i,X15: $i,X16: $i,X17: $i] :
( ( ( parent_THFTYPE_IiioI @ ( esk1_2 @ X12 @ X13 ) @ X12 )
| ~ ( grandchild_THFTYPE_IiioI @ X12 @ X13 ) )
& ( ( parent_THFTYPE_IiioI @ X13 @ ( esk1_2 @ X12 @ X13 ) )
| ~ ( grandchild_THFTYPE_IiioI @ X12 @ X13 ) )
& ( ~ ( parent_THFTYPE_IiioI @ X17 @ X15 )
| ~ ( parent_THFTYPE_IiioI @ X16 @ X17 )
| ( grandchild_THFTYPE_IiioI @ X15 @ X16 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_002])])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
~ ( ltet_THFTYPE_IiioI
@ ( lCardinalityFn_THFTYPE_IIioIiI
@ ^ [Z0: $i] : ( grandchild_THFTYPE_IiioI @ Z0 @ lJohn_THFTYPE_i ) )
@ X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
ltet_THFTYPE_IiioI @ ( lCardinalityFn_THFTYPE_IIioIiI @ ( grandparent_THFTYPE_IiioI @ lJohn_THFTYPE_i ) ) @ n3_THFTYPE_i,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( grandparent_THFTYPE_IiioI @ X1 @ X3 )
| ~ ( parent_THFTYPE_IiioI @ X1 @ X2 )
| ~ ( parent_THFTYPE_IiioI @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
! [X1: $i,X2: $i] :
( ( parent_THFTYPE_IiioI @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ~ ( grandchild_THFTYPE_IiioI @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
( ( ^ [Z0: $i] : ( grandchild_THFTYPE_IiioI @ Z0 @ lJohn_THFTYPE_i ) )
!= ( grandparent_THFTYPE_IiioI @ lJohn_THFTYPE_i ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_14,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( grandparent_THFTYPE_IiioI @ X1 @ X2 )
| ~ ( parent_THFTYPE_IiioI @ X1 @ ( esk1_2 @ X2 @ X3 ) )
| ~ ( grandchild_THFTYPE_IiioI @ X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,plain,
! [X2: $i,X1: $i] :
( ( parent_THFTYPE_IiioI @ X1 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( grandchild_THFTYPE_IiioI @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,plain,
( ( grandchild_THFTYPE_IiioI @ esk3_0 @ lJohn_THFTYPE_i )
<~> ( grandparent_THFTYPE_IiioI @ lJohn_THFTYPE_i @ esk3_0 ) ),
inference(neg_ext,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X2: $i,X1: $i] :
( ( grandparent_THFTYPE_IiioI @ X1 @ X2 )
| ~ ( grandchild_THFTYPE_IiioI @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
( ( grandparent_THFTYPE_IiioI @ lJohn_THFTYPE_i @ esk3_0 )
| ( grandchild_THFTYPE_IiioI @ esk3_0 @ lJohn_THFTYPE_i ) ),
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_19,plain,
! [X3: $i,X2: $i,X1: $i] :
( ( grandchild_THFTYPE_IiioI @ X2 @ X3 )
| ~ ( parent_THFTYPE_IiioI @ X1 @ X2 )
| ~ ( parent_THFTYPE_IiioI @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_20,plain,
! [X1: $i,X2: $i] :
( ( parent_THFTYPE_IiioI @ X1 @ ( esk2_2 @ X1 @ X2 ) )
| ~ ( grandparent_THFTYPE_IiioI @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_21,plain,
( ~ ( grandchild_THFTYPE_IiioI @ esk3_0 @ lJohn_THFTYPE_i )
| ~ ( grandparent_THFTYPE_IiioI @ lJohn_THFTYPE_i @ esk3_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_22,plain,
grandparent_THFTYPE_IiioI @ lJohn_THFTYPE_i @ esk3_0,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_23,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( grandchild_THFTYPE_IiioI @ X1 @ X2 )
| ~ ( parent_THFTYPE_IiioI @ ( esk2_2 @ X2 @ X3 ) @ X1 )
| ~ ( grandparent_THFTYPE_IiioI @ X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,plain,
! [X1: $i,X2: $i] :
( ( parent_THFTYPE_IiioI @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ~ ( grandparent_THFTYPE_IiioI @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_25,plain,
~ ( grandchild_THFTYPE_IiioI @ esk3_0 @ lJohn_THFTYPE_i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
thf(c_0_26,plain,
! [X2: $i,X1: $i] :
( ( grandchild_THFTYPE_IiioI @ X1 @ X2 )
| ~ ( grandparent_THFTYPE_IiioI @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR150^1 : TPTP v8.2.0. Released v4.1.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 00:25:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.23/0.47 Running higher-order theorem proving
% 0.23/0.47 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.23/0.49 # Version: 3.1.0-ho
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.23/0.49 # Starting sh5l with 300s (1) cores
% 0.23/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.23/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.23/0.49 # sh5l with pid 12964 completed with status 0
% 0.23/0.49 # Result found by sh5l
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.23/0.49 # Starting sh5l with 300s (1) cores
% 0.23/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.49 # Search class: HHUNF-FFSF21-MSSFFFNN
% 0.23/0.49 # partial match(2): HHUNF-FFSF22-SSSFFFNN
% 0.23/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.23/0.49 # new_ho_10 with pid 12969 completed with status 9
% 0.23/0.49 # Starting sh5l with 31s (1) cores
% 0.23/0.49 # sh5l with pid 12976 completed with status 0
% 0.23/0.49 # Result found by sh5l
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.23/0.49 # Starting sh5l with 300s (1) cores
% 0.23/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.49 # Search class: HHUNF-FFSF21-MSSFFFNN
% 0.23/0.49 # partial match(2): HHUNF-FFSF22-SSSFFFNN
% 0.23/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.23/0.49 # new_ho_10 with pid 12969 completed with status 9
% 0.23/0.49 # Starting sh5l with 31s (1) cores
% 0.23/0.49 # Preprocessing time : 0.001 s
% 0.23/0.49 # Presaturation interreduction done
% 0.23/0.49
% 0.23/0.49 # Proof found!
% 0.23/0.49 # SZS status Theorem
% 0.23/0.49 # SZS output start CNFRefutation
% See solution above
% 0.23/0.49 # Parsed axioms : 12
% 0.23/0.49 # Removed by relevancy pruning/SinE : 8
% 0.23/0.49 # Initial clauses : 8
% 0.23/0.49 # Removed in clause preprocessing : 0
% 0.23/0.49 # Initial clauses in saturation : 8
% 0.23/0.49 # Processed clauses : 27
% 0.23/0.49 # ...of these trivial : 0
% 0.23/0.49 # ...subsumed : 0
% 0.23/0.49 # ...remaining for further processing : 27
% 0.23/0.49 # Other redundant clauses eliminated : 1
% 0.23/0.49 # Clauses deleted for lack of memory : 0
% 0.23/0.49 # Backward-subsumed : 0
% 0.23/0.49 # Backward-rewritten : 2
% 0.23/0.49 # Generated clauses : 26
% 0.23/0.49 # ...of the previous two non-redundant : 22
% 0.23/0.49 # ...aggressively subsumed : 0
% 0.23/0.49 # Contextual simplify-reflections : 0
% 0.23/0.49 # Paramodulations : 21
% 0.23/0.49 # Factorizations : 0
% 0.23/0.49 # NegExts : 1
% 0.23/0.49 # Equation resolutions : 1
% 0.23/0.49 # Disequality decompositions : 0
% 0.23/0.49 # Total rewrite steps : 3
% 0.23/0.49 # ...of those cached : 2
% 0.23/0.49 # Propositional unsat checks : 0
% 0.23/0.49 # Propositional check models : 0
% 0.23/0.49 # Propositional check unsatisfiable : 0
% 0.23/0.49 # Propositional clauses : 0
% 0.23/0.49 # Propositional clauses after purity: 0
% 0.23/0.49 # Propositional unsat core size : 0
% 0.23/0.49 # Propositional preprocessing time : 0.000
% 0.23/0.49 # Propositional encoding time : 0.000
% 0.23/0.49 # Propositional solver time : 0.000
% 0.23/0.49 # Success case prop preproc time : 0.000
% 0.23/0.49 # Success case prop encoding time : 0.000
% 0.23/0.49 # Success case prop solver time : 0.000
% 0.23/0.49 # Current number of processed clauses : 16
% 0.23/0.49 # Positive orientable unit clauses : 2
% 0.23/0.49 # Positive unorientable unit clauses: 0
% 0.23/0.49 # Negative unit clauses : 3
% 0.23/0.49 # Non-unit-clauses : 11
% 0.23/0.49 # Current number of unprocessed clauses: 11
% 0.23/0.49 # ...number of literals in the above : 33
% 0.23/0.49 # Current number of archived formulas : 0
% 0.23/0.49 # Current number of archived clauses : 11
% 0.23/0.49 # Clause-clause subsumption calls (NU) : 22
% 0.23/0.49 # Rec. Clause-clause subsumption calls : 20
% 0.23/0.49 # Non-unit clause-clause subsumptions : 0
% 0.23/0.49 # Unit Clause-clause subsumption calls : 6
% 0.23/0.49 # Rewrite failures with RHS unbound : 0
% 0.23/0.49 # BW rewrite match attempts : 1
% 0.23/0.49 # BW rewrite match successes : 1
% 0.23/0.49 # Condensation attempts : 27
% 0.23/0.49 # Condensation successes : 0
% 0.23/0.49 # Termbank termtop insertions : 1375
% 0.23/0.49 # Search garbage collected termcells : 182
% 0.23/0.49
% 0.23/0.49 # -------------------------------------------------
% 0.23/0.49 # User time : 0.010 s
% 0.23/0.49 # System time : 0.001 s
% 0.23/0.49 # Total time : 0.011 s
% 0.23/0.49 # Maximum resident set size: 1744 pages
% 0.23/0.49
% 0.23/0.49 # -------------------------------------------------
% 0.23/0.49 # User time : 0.012 s
% 0.23/0.49 # System time : 0.002 s
% 0.23/0.49 # Total time : 0.014 s
% 0.23/0.49 # Maximum resident set size: 1700 pages
% 0.23/0.49 % E---3.1 exiting
% 0.23/0.49 % E exiting
%------------------------------------------------------------------------------