TSTP Solution File: SYO581+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYO581+1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %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 : Fri Sep 1 04:40:11 EDT 2023
% Result : CounterSatisfiable 4.08s 1.14s
% Output : Model 4.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Negative definition of k04_buttercup10026
fof(lit_def,axiom,
! [X0] :
( ~ k04_buttercup10026(X0)
<=> ( X0 = sK40
| X0 = sK45
| X0 = sK110 ) ) ).
%------ Negative definition of k04_buttercup10204
fof(lit_def_001,axiom,
! [X0] :
( ~ k04_buttercup10204(X0)
<=> ( X0 = sK48
| X0 = sK96
| X0 = sK101
| X0 = sK110 ) ) ).
%------ Negative definition of k04_buttercup10619
fof(lit_def_002,axiom,
! [X0] :
( ~ k04_buttercup10619(X0)
<=> ( X0 = sK55
| X0 = sK60
| X0 = sK62
| X0 = sK110 ) ) ).
%------ Negative definition of k04_buttercup10012
fof(lit_def_003,axiom,
! [X0] :
( ~ k04_buttercup10012(X0)
<=> $false ) ).
%------ Negative definition of k04_buttercup10282
fof(lit_def_004,axiom,
! [X0] :
( ~ k04_buttercup10282(X0)
<=> ( X0 = sK110
| X0 = sK114
| X0 = sK137 ) ) ).
%------ Negative definition of k04_buttercup10100
fof(lit_def_005,axiom,
! [X0] :
( ~ k04_buttercup10100(X0)
<=> ( X0 = sK66
| X0 = sK71
| X0 = sK76
| X0 = sK82
| X0 = sK110
| X0 = sK126
| X0 = sK130 ) ) ).
%------ Negative definition of k04_buttercup10419
fof(lit_def_006,axiom,
! [X0] :
( ~ k04_buttercup10419(X0)
<=> ( X0 = sK110
| X0 = sK165
| X0 = sK169
| X0 = sK173 ) ) ).
%------ Positive definition of b48_buttercup10307
fof(lit_def_007,axiom,
! [X0] :
( b48_buttercup10307(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10308
fof(lit_def_008,axiom,
! [X0] :
( b48_buttercup10308(X0)
<=> $false ) ).
%------ Negative definition of b48_buttercup10222
fof(lit_def_009,axiom,
! [X0] :
( ~ b48_buttercup10222(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10191
fof(lit_def_010,axiom,
! [X0] :
( b48_buttercup10191(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10193
fof(lit_def_011,axiom,
! [X0] :
( b48_buttercup10193(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10195
fof(lit_def_012,axiom,
! [X0] :
( b48_buttercup10195(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10133
fof(lit_def_013,axiom,
! [X0] :
( b48_buttercup10133(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10134
fof(lit_def_014,axiom,
! [X0] :
( b48_buttercup10134(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10343
fof(lit_def_015,axiom,
! [X0] :
( b48_buttercup10343(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10344
fof(lit_def_016,axiom,
! [X0] :
( b48_buttercup10344(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10348
fof(lit_def_017,axiom,
! [X0] :
( b48_buttercup10348(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10352
fof(lit_def_018,axiom,
! [X0] :
( b48_buttercup10352(X0)
<=> $false ) ).
%------ Negative definition of b48_buttercup10440
fof(lit_def_019,axiom,
! [X0] :
( ~ b48_buttercup10440(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10441
fof(lit_def_020,axiom,
! [X0] :
( b48_buttercup10441(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10478
fof(lit_def_021,axiom,
! [X0] :
( b48_buttercup10478(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10483
fof(lit_def_022,axiom,
! [X0] :
( b48_buttercup10483(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10166
fof(lit_def_023,axiom,
! [X0] :
( b48_buttercup10166(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10167
fof(lit_def_024,axiom,
! [X0] :
( b48_buttercup10167(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10169
fof(lit_def_025,axiom,
! [X0] :
( b48_buttercup10169(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10120
fof(lit_def_026,axiom,
! [X0] :
( b48_buttercup10120(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10320
fof(lit_def_027,axiom,
! [X0] :
( b48_buttercup10320(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10173
fof(lit_def_028,axiom,
! [X0] :
( b48_buttercup10173(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10174
fof(lit_def_029,axiom,
! [X0] :
( b48_buttercup10174(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10574
fof(lit_def_030,axiom,
! [X0] :
( b48_buttercup10574(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10154
fof(lit_def_031,axiom,
! [X0] :
( b48_buttercup10154(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10156
fof(lit_def_032,axiom,
! [X0] :
( b48_buttercup10156(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10158
fof(lit_def_033,axiom,
! [X0] :
( b48_buttercup10158(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10159
fof(lit_def_034,axiom,
! [X0] :
( b48_buttercup10159(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10160
fof(lit_def_035,axiom,
! [X0] :
( b48_buttercup10160(X0)
<=> $false ) ).
%------ Negative definition of b48_buttercup10458
fof(lit_def_036,axiom,
! [X0] :
( ~ b48_buttercup10458(X0)
<=> $false ) ).
%------ Negative definition of b48_buttercup10029
fof(lit_def_037,axiom,
! [X0] :
( ~ b48_buttercup10029(X0)
<=> ( X0 = sK37
| X0 = sK39
| X0 = sK110
| X0 = sK140 ) ) ).
%------ Positive definition of sP1
fof(lit_def_038,axiom,
( sP1
<=> $false ) ).
%------ Positive definition of sP0
fof(lit_def_039,axiom,
( sP0
<=> $true ) ).
%------ Positive definition of b48_buttercup10102
fof(lit_def_040,axiom,
! [X0] :
( b48_buttercup10102(X0)
<=> ( X0 = sK130
| X0 = sK128
| X0 = sK434 ) ) ).
%------ Positive definition of b48_buttercup10111
fof(lit_def_041,axiom,
! [X0] :
( b48_buttercup10111(X0)
<=> ( X0 = sK55
| X0 = sK53
| X0 = sK458 ) ) ).
%------ Positive definition of sP3
fof(lit_def_042,axiom,
( sP3
<=> $false ) ).
%------ Positive definition of sP2
fof(lit_def_043,axiom,
( sP2
<=> $true ) ).
%------ Positive definition of b48_buttercup10109
fof(lit_def_044,axiom,
! [X0] :
( b48_buttercup10109(X0)
<=> ( X0 = sK60
| X0 = sK58
| X0 = sK439 ) ) ).
%------ Positive definition of sP5
fof(lit_def_045,axiom,
( sP5
<=> $false ) ).
%------ Positive definition of sP4
fof(lit_def_046,axiom,
( sP4
<=> $true ) ).
%------ Positive definition of b48_buttercup10107
fof(lit_def_047,axiom,
! [X0] :
( b48_buttercup10107(X0)
<=> ( X0 = sK71
| X0 = sK69
| X0 = sK287
| X0 = sK437 ) ) ).
%------ Positive definition of b48_buttercup10108
fof(lit_def_048,axiom,
! [X0] :
( b48_buttercup10108(X0)
<=> ( X0 = sK66
| X0 = sK64
| X0 = sK438 ) ) ).
%------ Positive definition of sP7
fof(lit_def_049,axiom,
( sP7
<=> $false ) ).
%------ Positive definition of sP6
fof(lit_def_050,axiom,
( sP6
<=> $true ) ).
%------ Positive definition of sP9
fof(lit_def_051,axiom,
( sP9
<=> $false ) ).
%------ Positive definition of sP8
fof(lit_def_052,axiom,
( sP8
<=> $true ) ).
%------ Positive definition of b48_buttercup10104
fof(lit_def_053,axiom,
! [X0] :
( b48_buttercup10104(X0)
<=> ( X0 = sK76
| X0 = sK74
| X0 = sK435 ) ) ).
%------ Positive definition of sP11
fof(lit_def_054,axiom,
( sP11
<=> $false ) ).
%------ Positive definition of sP10
fof(lit_def_055,axiom,
( sP10
<=> $true ) ).
%------ Positive definition of b48_buttercup10110
fof(lit_def_056,axiom,
! [X0] :
( b48_buttercup10110(X0)
<=> ( X0 = sK82
| X0 = sK80
| X0 = sK459 ) ) ).
%------ Positive definition of sP13
fof(lit_def_057,axiom,
( sP13
<=> $false ) ).
%------ Positive definition of sP12
fof(lit_def_058,axiom,
( sP12
<=> $true ) ).
%------ Negative definition of b48_buttercup10289
fof(lit_def_059,axiom,
! [X0] :
( ~ b48_buttercup10289(X0)
<=> ( X0 = sK110
| X0 = sK111
| X0 = sK113 ) ) ).
%------ Positive definition of b48_buttercup10421
fof(lit_def_060,axiom,
! [X0] :
( b48_buttercup10421(X0)
<=> ( X0 = sK165
| X0 = sK163
| X0 = sK166
| X0 = sK216
| X0 = sK325 ) ) ).
%------ Negative definition of b48_buttercup10417
fof(lit_def_061,axiom,
! [X0] :
( ~ b48_buttercup10417(X0)
<=> $false ) ).
%------ Negative definition of b48_buttercup10214
fof(lit_def_062,axiom,
! [X0] :
( ~ b48_buttercup10214(X0)
<=> ( X0 = sK93
| X0 = sK95
| X0 = sK110
| X0 = sK151 ) ) ).
%------ Positive definition of sP15
fof(lit_def_063,axiom,
( sP15
<=> $false ) ).
%------ Positive definition of sP14
fof(lit_def_064,axiom,
( sP14
<=> $true ) ).
%------ Negative definition of b48_buttercup10208
fof(lit_def_065,axiom,
! [X0] :
( ~ b48_buttercup10208(X0)
<=> ( X0 = sK98
| X0 = sK100
| X0 = sK110
| X0 = sK152 ) ) ).
%------ Positive definition of sP17
fof(lit_def_066,axiom,
( sP17
<=> $false ) ).
%------ Positive definition of sP16
fof(lit_def_067,axiom,
( sP16
<=> $true ) ).
%------ Positive definition of b48_buttercup10179
fof(lit_def_068,axiom,
! [X0] :
( b48_buttercup10179(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10398
fof(lit_def_069,axiom,
! [X0] :
( b48_buttercup10398(X0)
<=> $false ) ).
%------ Positive definition of k04_buttercup10004
fof(lit_def_070,axiom,
! [X0] :
( k04_buttercup10004(X0)
<=> X0 = sK248 ) ).
%------ Positive definition of sP19
fof(lit_def_071,axiom,
( sP19
<=> $false ) ).
%------ Positive definition of sP18
fof(lit_def_072,axiom,
( sP18
<=> $true ) ).
%------ Positive definition of k04_buttercup10000
fof(lit_def_073,axiom,
! [X0] :
( k04_buttercup10000(X0)
<=> X0 = sK247 ) ).
%------ Positive definition of sP21
fof(lit_def_074,axiom,
( sP21
<=> $false ) ).
%------ Positive definition of sP20
fof(lit_def_075,axiom,
( sP20
<=> $true ) ).
%------ Positive definition of b48_buttercup10362
fof(lit_def_076,axiom,
! [X0] :
( b48_buttercup10362(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10570
fof(lit_def_077,axiom,
! [X0] :
( b48_buttercup10570(X0)
<=> $false ) ).
%------ Positive definition of b48_buttercup10261
fof(lit_def_078,axiom,
! [X0] :
( b48_buttercup10261(X0)
<=> X0 = sK368 ) ).
%------ Positive definition of b48_buttercup10260
fof(lit_def_079,axiom,
! [X0] :
( b48_buttercup10260(X0)
<=> X0 = sK312 ) ).
%------ Positive definition of b48_buttercup10572
fof(lit_def_080,axiom,
! [X0] :
( b48_buttercup10572(X0)
<=> $false ) ).
%------ Positive definition of sP23
fof(lit_def_081,axiom,
( sP23
<=> $false ) ).
%------ Positive definition of sP22
fof(lit_def_082,axiom,
( sP22
<=> $true ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_083,axiom,
( sP0_iProver_split
<=> $false ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_084,axiom,
( sP1_iProver_split
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_085,axiom,
( sP2_iProver_split
<=> $false ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_086,axiom,
( sP3_iProver_split
<=> $false ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_087,axiom,
( sP4_iProver_split
<=> $false ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_088,axiom,
( sP5_iProver_split
<=> $false ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_089,axiom,
( sP6_iProver_split
<=> $false ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_090,axiom,
( sP7_iProver_split
<=> $false ) ).
%------ Positive definition of sP8_iProver_split
fof(lit_def_091,axiom,
( sP8_iProver_split
<=> $false ) ).
%------ Positive definition of sP9_iProver_split
fof(lit_def_092,axiom,
( sP9_iProver_split
<=> $false ) ).
%------ Positive definition of sP10_iProver_split
fof(lit_def_093,axiom,
( sP10_iProver_split
<=> $false ) ).
%------ Positive definition of sP11_iProver_split
fof(lit_def_094,axiom,
( sP11_iProver_split
<=> $false ) ).
%------ Positive definition of sP12_iProver_split
fof(lit_def_095,axiom,
( sP12_iProver_split
<=> $false ) ).
%------ Positive definition of sP13_iProver_split
fof(lit_def_096,axiom,
( sP13_iProver_split
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO581+1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n025.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 : Sat Aug 26 03:46:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.08/1.14 % SZS status Started for theBenchmark.p
% 4.08/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 4.08/1.14
% 4.08/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.08/1.14
% 4.08/1.14 ------ iProver source info
% 4.08/1.14
% 4.08/1.14 git: date: 2023-05-31 18:12:56 +0000
% 4.08/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.08/1.14 git: non_committed_changes: false
% 4.08/1.14 git: last_make_outside_of_git: false
% 4.08/1.14
% 4.08/1.14 ------ Parsing...
% 4.08/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 4.08/1.14
% 4.08/1.14
% 4.08/1.14 ------ Preprocessing... sf_s rm: 53 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe:64:0s pe:128:0s pe:256:0s pe_e sf_s rm: 111 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 4.08/1.14
% 4.08/1.14 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 4.08/1.14 gs_s sp: 28 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.08/1.14 ------ Proving...
% 4.08/1.14 ------ Problem Properties
% 4.08/1.14
% 4.08/1.14
% 4.08/1.14 clauses 132
% 4.08/1.14 conjectures 0
% 4.08/1.14 EPR 132
% 4.08/1.14 Horn 111
% 4.08/1.14 unary 27
% 4.08/1.14 binary 63
% 4.08/1.14 lits 300
% 4.08/1.14 lits eq 0
% 4.08/1.14 fd_pure 0
% 4.08/1.14 fd_pseudo 0
% 4.08/1.14 fd_cond 0
% 4.08/1.14 fd_pseudo_cond 0
% 4.08/1.14 AC symbols 0
% 4.08/1.14
% 4.08/1.14 ------ Schedule EPR non Horn non eq is on
% 4.08/1.14
% 4.08/1.14 ------ no conjectures: strip conj schedule
% 4.08/1.14
% 4.08/1.14 ------ no equalities: superposition off
% 4.08/1.14
% 4.08/1.14 ------ Input Options "--resolution_flag false" stripped conjectures Time Limit: 70.
% 4.08/1.14
% 4.08/1.14
% 4.08/1.14 ------
% 4.08/1.14 Current options:
% 4.08/1.14 ------
% 4.08/1.14
% 4.08/1.14
% 4.08/1.14
% 4.08/1.14
% 4.08/1.14 ------ Proving...
% 4.08/1.14
% 4.08/1.14
% 4.08/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 4.08/1.14
% 4.08/1.14 ------ Building Model...Done
% 4.08/1.14
% 4.08/1.14 %------ The model is defined over ground terms (initial term algebra).
% 4.08/1.14 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.08/1.14 %------ where \phi is a formula over the term algebra.
% 4.08/1.14 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.08/1.14 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.08/1.14 %------ See help for --sat_out_model for different model outputs.
% 4.08/1.14 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.08/1.14 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.08/1.14 % SZS output start Model for theBenchmark.p
% See solution above
% 4.15/1.15
%------------------------------------------------------------------------------