TSTP Solution File: GRA015+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRA015+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : Thu Aug 31 00:03:13 EDT 2023
% Result : CounterSatisfiable 3.50s 1.14s
% Output : Model 3.50s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of less_than
fof(lit_def,axiom,
! [X0,X1] :
( less_than(X0,X1)
<=> ( ( X0 = n10
& X1 = n11 )
| ( X0 = n9
& X1 = n10 )
| ( X0 = n9
& X1 = n11 )
| ( X0 = n8
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n8
& X1 = n9 )
| ( X0 = n7
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n7
& X1 = n8 )
| ( X0 = n6
& X1 != n8
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n6
& X1 = n8 )
| ( X0 = n6
& X1 = n7 )
| ( X0 = n5
& X1 != n11
& X1 != n8
& X1 != n7
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n5
& X1 = n11 )
| ( X0 = n5
& X1 = n8 )
| ( X0 = n5
& X1 = n7 )
| ( X0 = n5
& X1 = n6 )
| ( X0 = n4
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n4
& X1 = n11 )
| ( X0 = n4
& X1 = n9 )
| ( X0 = n4
& X1 = n8 )
| ( X0 = n4
& X1 = n7 )
| ( X0 = n4
& X1 = n6 )
| ( X0 = n4
& X1 = n5 )
| ( X0 = n3
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n3
& X1 = n8 )
| ( X0 = n3
& X1 = n7 )
| ( X0 = n3
& X1 = n6 )
| ( X0 = n3
& X1 = n5 )
| ( X0 = n3
& X1 = n4 )
| ( X0 = n2
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n2
& X1 != n1 )
| ( X0 = n2
& X1 = n11 )
| ( X0 = n2
& X1 = n9 )
| ( X0 = n2
& X1 = n8 )
| ( X0 = n2
& X1 = n7 )
| ( X0 = n2
& X1 = n6 )
| ( X0 = n2
& X1 = n5 )
| ( X0 = n2
& X1 = n4 )
| ( X0 = n2
& X1 = n3 )
| ( X0 = n1
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n1 )
| ( X0 = n1
& X1 = n11 )
| ( X0 = n1
& X1 = n9 )
| ( X0 = n1
& X1 = n8 )
| ( X0 = n1
& X1 = n7 )
| ( X0 = n1
& X1 = n6 )
| ( X0 = n1
& X1 = n5 )
| ( X0 = n1
& X1 = n4 )
| ( X0 = n1
& X1 = n3 )
| ( X0 = n1
& X1 = n2 ) ) ) ).
%------ Positive definition of goal
fof(lit_def_001,axiom,
( goal
<=> $false ) ).
%------ Positive definition of red
fof(lit_def_002,axiom,
! [X0,X1] :
( red(X0,X1)
<=> ( ( X0 = n10
& X1 = n11 )
| ( X0 = n9
& X1 = n11 )
| ( X0 = n8
& X1 != n10
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n8
& X1 = n10 )
| ( X0 = n8
& X1 = n11 )
| ( X0 = n6
& X1 = n11 )
| ( X0 = n6
& X1 = n7 )
| ( X0 = n5
& X1 = n9 )
| ( X0 = n4
& X1 = n9 )
| ( X0 = n4
& X1 = n8 )
| ( X0 = n4
& X1 = n7 )
| ( X0 = n4
& X1 = n6 )
| ( X0 = n3
& X1 = n11 )
| ( X0 = n3
& X1 = n9 )
| ( X0 = n3
& X1 = n8 )
| ( X0 = n3
& X1 = n7 )
| ( X0 = n3
& X1 = n5 )
| ( X0 = n2
& X1 = n11 )
| ( X0 = n2
& X1 = n9 )
| ( X0 = n2
& X1 = n8 )
| ( X0 = n2
& X1 = n6 )
| ( X0 = n2
& X1 = n5 )
| ( X0 = n2
& X1 = n4 )
| ( X0 = n1
& X1 != n10
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n1
& X1 = n10 )
| ( X0 = n1
& X1 = n11 )
| ( X0 = n1
& X1 = n7 )
| ( X0 = n1
& X1 = n6 )
| ( X0 = n1
& X1 = n5 )
| ( X0 = n1
& X1 = n3 ) ) ) ).
%------ Positive definition of green
fof(lit_def_003,axiom,
! [X0,X1] :
( green(X0,X1)
<=> ( ( X0 = n9
& X1 = n10 )
| ( X0 = n8
& X1 = n9 )
| ( X0 = n7
& X1 != n10
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n7
& X1 = n10 )
| ( X0 = n7
& X1 = n11 )
| ( X0 = n7
& X1 = n9 )
| ( X0 = n7
& X1 = n8 )
| ( X0 = n6
& X1 != n10
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n6
& X1 = n10 )
| ( X0 = n6
& X1 = n9 )
| ( X0 = n6
& X1 = n8 )
| ( X0 = n5
& X1 != n10
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n5
& X1 = n10 )
| ( X0 = n5
& X1 = n11 )
| ( X0 = n5
& X1 = n8 )
| ( X0 = n5
& X1 = n7 )
| ( X0 = n5
& X1 = n6 )
| ( X0 = n4
& X1 != n10
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n4
& X1 = n10 )
| ( X0 = n4
& X1 = n11 )
| ( X0 = n4
& X1 = n5 )
| ( X0 = n3
& X1 != n10
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n3
& X1 = n10 )
| ( X0 = n3
& X1 = n6 )
| ( X0 = n3
& X1 = n4 )
| ( X0 = n2
& X1 != n10
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n2
& X1 = n10 )
| ( X0 = n2
& X1 = n7 )
| ( X0 = n2
& X1 = n3 )
| ( X0 = n1
& X1 = n9 )
| ( X0 = n1
& X1 = n8 )
| ( X0 = n1
& X1 = n4 )
| ( X0 = n1
& X1 = n2 ) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRA015+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Aug 27 03:26:27 EDT 2023
% 0.21/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.50/1.14 % SZS status Started for theBenchmark.p
% 3.50/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 3.50/1.14
% 3.50/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.50/1.14
% 3.50/1.14 ------ iProver source info
% 3.50/1.14
% 3.50/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.50/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.50/1.14 git: non_committed_changes: false
% 3.50/1.14 git: last_make_outside_of_git: false
% 3.50/1.14
% 3.50/1.14 ------ Parsing...
% 3.50/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 3.50/1.14
% 3.50/1.14
% 3.50/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 3.50/1.14
% 3.50/1.14 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 3.50/1.14 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.50/1.14 ------ Proving...
% 3.50/1.14 ------ Problem Properties
% 3.50/1.14
% 3.50/1.14
% 3.50/1.14 clauses 15
% 3.50/1.14 conjectures 0
% 3.50/1.14 EPR 15
% 3.50/1.14 Horn 14
% 3.50/1.14 unary 10
% 3.50/1.14 binary 1
% 3.50/1.14 lits 30
% 3.50/1.14 lits eq 0
% 3.50/1.14 fd_pure 0
% 3.50/1.14 fd_pseudo 0
% 3.50/1.14 fd_cond 0
% 3.50/1.14 fd_pseudo_cond 0
% 3.50/1.14 AC symbols 0
% 3.50/1.14
% 3.50/1.14 ------ Schedule EPR non Horn non eq is on
% 3.50/1.14
% 3.50/1.14 ------ no conjectures: strip conj schedule
% 3.50/1.14
% 3.50/1.14 ------ no equalities: superposition off
% 3.50/1.14
% 3.50/1.14 ------ Input Options "--resolution_flag false" stripped conjectures Time Limit: 70.
% 3.50/1.14
% 3.50/1.14
% 3.50/1.14 ------
% 3.50/1.14 Current options:
% 3.50/1.14 ------
% 3.50/1.14
% 3.50/1.14
% 3.50/1.14
% 3.50/1.14
% 3.50/1.14 ------ Proving...
% 3.50/1.14
% 3.50/1.14
% 3.50/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 3.50/1.14
% 3.50/1.14 ------ Building Model...Done
% 3.50/1.14
% 3.50/1.14 %------ The model is defined over ground terms (initial term algebra).
% 3.50/1.14 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.50/1.14 %------ where \phi is a formula over the term algebra.
% 3.50/1.14 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.50/1.14 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.50/1.14 %------ See help for --sat_out_model for different model outputs.
% 3.50/1.14 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.50/1.14 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.50/1.14 % SZS output start Model for theBenchmark.p
% See solution above
% 3.50/1.15
%------------------------------------------------------------------------------