TSTP Solution File: CSR138^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR138^2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 33 ( 17 unt; 10 typ; 0 def)
% Number of atoms : 35 ( 5 equ; 0 cnn)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 174 ( 38 ~; 31 |; 9 &; 94 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 10 con; 0-2 aty)
% Number of variables : 53 ( 4 ^ 35 !; 14 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_57,type,
lAnna_THFTYPE_i: $i ).
thf(decl_62,type,
lBill_THFTYPE_i: $i ).
thf(decl_65,type,
lBob_THFTYPE_i: $i ).
thf(decl_94,type,
lSue_THFTYPE_i: $i ).
thf(decl_104,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_113,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_136,type,
esk1_0: $i ).
thf(decl_137,type,
esk2_0: $i ).
thf(decl_143,type,
esk8_0: $i ).
thf(decl_144,type,
esk9_0: $i ).
thf(con,conjecture,
? [X60: $i > $i > $o,X61: $i > $i > $o,X2: $i] :
( ( X61 @ X2 @ lBill_THFTYPE_i )
& ( X60 @ X2 @ lAnna_THFTYPE_i )
& ( X61
!= ( ^ [X3: $i,X62: $i] : $true ) )
& ( X60
!= ( ^ [X3: $i,X62: $i] : $true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(ax_029,axiom,
? [X1: $i,X2: $i] :
~ ( parent_THFTYPE_IiioI @ X1 @ X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_029) ).
thf(ax_004,axiom,
? [X1: $i,X2: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_004) ).
thf(ax_050,axiom,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_050) ).
thf(ax_060,axiom,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_060) ).
thf(c_0_5,negated_conjecture,
~ ? [X60: $i > $i > $o,X61: $i > $i > $o,X2: $i] :
( ( X61 @ X2 @ lBill_THFTYPE_i )
& ( X60 @ X2 @ lAnna_THFTYPE_i )
& ~ ! [X225: $i,X226: $i] :
( ( X61 @ X225 @ X226 )
<=> $true )
& ~ ! [X227: $i,X228: $i] :
( ( X60 @ X227 @ X228 )
<=> $true ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])])]) ).
thf(c_0_6,negated_conjecture,
! [X395: $i > $i > $o,X396: $i > $i > $o,X397: $i,X398: $i,X399: $i,X400: $i,X401: $i] :
( ( ~ ( X395 @ X400 @ X401 )
| $true
| ~ ( X396 @ X398 @ X399 )
| $true
| ~ ( X396 @ X397 @ lBill_THFTYPE_i )
| ~ ( X395 @ X397 @ lAnna_THFTYPE_i ) )
& ( ~ $true
| ( X395 @ X400 @ X401 )
| ~ ( X396 @ X398 @ X399 )
| $true
| ~ ( X396 @ X397 @ lBill_THFTYPE_i )
| ~ ( X395 @ X397 @ lAnna_THFTYPE_i ) )
& ( ~ ( X395 @ X400 @ X401 )
| $true
| ~ $true
| ( X396 @ X398 @ X399 )
| ~ ( X396 @ X397 @ lBill_THFTYPE_i )
| ~ ( X395 @ X397 @ lAnna_THFTYPE_i ) )
& ( ~ $true
| ( X395 @ X400 @ X401 )
| ~ $true
| ( X396 @ X398 @ X399 )
| ~ ( X396 @ X397 @ lBill_THFTYPE_i )
| ~ ( X395 @ X397 @ lAnna_THFTYPE_i ) ) ),
inference(distribute,[status(thm)],[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,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i,X60: $i > $i > $o,X35: $i > $i > $o,X5: $i] :
( ( X35 @ X1 @ X2 )
| ( X60 @ X3 @ X4 )
| ~ $true
| ~ $true
| ~ ( X60 @ X5 @ lBill_THFTYPE_i )
| ~ ( X35 @ X5 @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,plain,
? [X1: $i,X2: $i] :
~ ( parent_THFTYPE_IiioI @ X1 @ X2 ),
inference(fof_simplification,[status(thm)],[ax_029]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i,X60: $i > $i > $o,X35: $i > $i > $o,X5: $i] :
( ( X60 @ X3 @ X4 )
| ( X35 @ X1 @ X2 )
| ~ ( X60 @ X5 @ lBill_THFTYPE_i )
| ~ ( X35 @ X5 @ lAnna_THFTYPE_i ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
? [X1: $i,X2: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X2 ),
inference(fof_simplification,[status(thm)],[ax_004]) ).
thf(c_0_11,plain,
~ ( parent_THFTYPE_IiioI @ esk8_0 @ esk9_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X35: $i > $i > $o,X4: $i] :
( ( lBill_THFTYPE_i = X1 )
| ( X35 @ X2 @ X3 )
| ~ ( X35 @ X4 @ lAnna_THFTYPE_i ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_9]) ).
thf(c_0_13,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_050]) ).
thf(c_0_14,plain,
~ ( likes_THFTYPE_IiioI @ esk1_0 @ esk2_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_10])])]) ).
thf(c_0_15,plain,
~ ( parent_THFTYPE_IiioI @ esk8_0 @ esk9_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( lBill_THFTYPE_i = X1 )
| ( parent_THFTYPE_IiioI @ X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,plain,
~ ( likes_THFTYPE_IiioI @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i] : ( lBill_THFTYPE_i = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_19,plain,
~ ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
thf(c_0_20,plain,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_060]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X1 ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
thf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_18]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR138^2 : TPTP v8.2.0. Released v4.1.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 01:11:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 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.21/0.55 # Version: 3.1.0-ho
% 0.21/0.55 # Preprocessing class: HSLMSMSMSSSNHSA.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.55 # Starting sh7 with 300s (1) cores
% 0.21/0.55 # Starting ho_unfolding_2 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_12 with 300s (1) cores
% 0.21/0.55 # ho_unfolding_3 with pid 20535 completed with status 0
% 0.21/0.55 # Result found by ho_unfolding_3
% 0.21/0.55 # Preprocessing class: HSLMSMSMSSSNHSA.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.55 # No SInE strategy applied
% 0.21/0.55 # Search class: HGHSF-FFMM21-SHSFFFBN
% 0.21/0.55 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55 # Starting ho_unfolding_3 with 901s (1) cores
% 0.21/0.55 # Starting sh5l with 151s (1) cores
% 0.21/0.55 # Starting ehoh_best8_lambda with 151s (1) cores
% 0.21/0.55 # Starting lpo8_lambda_fix with 151s (1) cores
% 0.21/0.55 # Starting sh4l with 146s (1) cores
% 0.21/0.55 # sh5l with pid 20543 completed with status 0
% 0.21/0.55 # Result found by sh5l
% 0.21/0.55 # Preprocessing class: HSLMSMSMSSSNHSA.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.55 # No SInE strategy applied
% 0.21/0.55 # Search class: HGHSF-FFMM21-SHSFFFBN
% 0.21/0.55 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55 # Starting ho_unfolding_3 with 901s (1) cores
% 0.21/0.55 # Starting sh5l with 151s (1) cores
% 0.21/0.55 # Preprocessing time : 0.004 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Theorem
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 330
% 0.21/0.55 # Removed by relevancy pruning/SinE : 0
% 0.21/0.55 # Initial clauses : 349
% 0.21/0.55 # Removed in clause preprocessing : 128
% 0.21/0.55 # Initial clauses in saturation : 221
% 0.21/0.55 # Processed clauses : 552
% 0.21/0.55 # ...of these trivial : 14
% 0.21/0.55 # ...subsumed : 29
% 0.21/0.55 # ...remaining for further processing : 508
% 0.21/0.55 # Other redundant clauses eliminated : 2
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 4
% 0.21/0.55 # Backward-rewritten : 178
% 0.21/0.55 # Generated clauses : 527
% 0.21/0.55 # ...of the previous two non-redundant : 669
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 0
% 0.21/0.55 # Paramodulations : 517
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 3
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 284
% 0.21/0.55 # ...of those cached : 192
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 112
% 0.21/0.55 # Positive orientable unit clauses : 79
% 0.21/0.55 # Positive unorientable unit clauses: 1
% 0.21/0.55 # Negative unit clauses : 4
% 0.21/0.55 # Non-unit-clauses : 28
% 0.21/0.55 # Current number of unprocessed clauses: 544
% 0.21/0.55 # ...number of literals in the above : 904
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 395
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 1783
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 1335
% 0.21/0.55 # Non-unit clause-clause subsumptions : 31
% 0.21/0.55 # Unit Clause-clause subsumption calls : 370
% 0.21/0.55 # Rewrite failures with RHS unbound : 83
% 0.21/0.55 # BW rewrite match attempts : 826
% 0.21/0.55 # BW rewrite match successes : 115
% 0.21/0.55 # Condensation attempts : 552
% 0.21/0.55 # Condensation successes : 7
% 0.21/0.55 # Termbank termtop insertions : 22021
% 0.21/0.55 # Search garbage collected termcells : 2184
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.041 s
% 0.21/0.55 # System time : 0.009 s
% 0.21/0.55 # Total time : 0.049 s
% 0.21/0.55 # Maximum resident set size: 2632 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.186 s
% 0.21/0.55 # System time : 0.028 s
% 0.21/0.55 # Total time : 0.213 s
% 0.21/0.55 # Maximum resident set size: 1976 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------