TSTP Solution File: GRA019+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRA019+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:14 EDT 2023
% Result : CounterSatisfiable 199.17s 27.40s
% Output : Saturation 199.17s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( less_than(n17,n18)
& less_than(n16,n17)
& less_than(n15,n16)
& less_than(n14,n15)
& less_than(n13,n14)
& less_than(n12,n13)
& less_than(n11,n12)
& less_than(n10,n11)
& less_than(n9,n10)
& less_than(n8,n9)
& less_than(n7,n8)
& less_than(n6,n7)
& less_than(n5,n6)
& less_than(n4,n5)
& less_than(n3,n4)
& less_than(n2,n3)
& less_than(n1,n2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordering) ).
fof(f2,axiom,
! [X0,X1,X2,X3] :
( ( red(X2,X3)
& red(X1,X3)
& red(X0,X3)
& red(X1,X2)
& red(X0,X2)
& red(X0,X1) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',red_clique) ).
fof(f3,axiom,
! [X0,X1,X2,X3] :
( ( green(X2,X3)
& green(X1,X3)
& green(X0,X3)
& green(X1,X2)
& green(X0,X2)
& green(X0,X1) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',green_clique) ).
fof(f4,axiom,
! [X0,X1,X2] :
( ( less_than(X1,X2)
& less_than(X0,X1) )
=> less_than(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_than_transitive) ).
fof(f5,axiom,
! [X0,X1] :
( less_than(X0,X1)
=> ( green(X0,X1)
| red(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partition) ).
fof(f6,conjecture,
goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f7,negated_conjecture,
~ goal,
inference(negated_conjecture,[],[f6]) ).
fof(f8,plain,
~ goal,
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0,X1,X2,X3] :
( goal
| ~ red(X2,X3)
| ~ red(X1,X3)
| ~ red(X0,X3)
| ~ red(X1,X2)
| ~ red(X0,X2)
| ~ red(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f10,plain,
! [X0,X1,X2,X3] :
( goal
| ~ red(X2,X3)
| ~ red(X1,X3)
| ~ red(X0,X3)
| ~ red(X1,X2)
| ~ red(X0,X2)
| ~ red(X0,X1) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2,X3] :
( goal
| ~ green(X2,X3)
| ~ green(X1,X3)
| ~ green(X0,X3)
| ~ green(X1,X2)
| ~ green(X0,X2)
| ~ green(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f12,plain,
! [X0,X1,X2,X3] :
( goal
| ~ green(X2,X3)
| ~ green(X1,X3)
| ~ green(X0,X3)
| ~ green(X1,X2)
| ~ green(X0,X2)
| ~ green(X0,X1) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X1,X2)
| ~ less_than(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X1,X2)
| ~ less_than(X0,X1) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( green(X0,X1)
| red(X0,X1)
| ~ less_than(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f16,plain,
! [X0,X1] :
( green(X0,X1)
| red(X0,X1)
| ~ less_than(X0,X1) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
less_than(n1,n2),
inference(cnf_transformation,[],[f1]) ).
fof(f18,plain,
less_than(n2,n3),
inference(cnf_transformation,[],[f1]) ).
fof(f19,plain,
less_than(n3,n4),
inference(cnf_transformation,[],[f1]) ).
fof(f20,plain,
less_than(n4,n5),
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
less_than(n5,n6),
inference(cnf_transformation,[],[f1]) ).
fof(f22,plain,
less_than(n6,n7),
inference(cnf_transformation,[],[f1]) ).
fof(f23,plain,
less_than(n7,n8),
inference(cnf_transformation,[],[f1]) ).
fof(f24,plain,
less_than(n8,n9),
inference(cnf_transformation,[],[f1]) ).
fof(f25,plain,
less_than(n9,n10),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
less_than(n10,n11),
inference(cnf_transformation,[],[f1]) ).
fof(f27,plain,
less_than(n11,n12),
inference(cnf_transformation,[],[f1]) ).
fof(f28,plain,
less_than(n12,n13),
inference(cnf_transformation,[],[f1]) ).
fof(f29,plain,
less_than(n13,n14),
inference(cnf_transformation,[],[f1]) ).
fof(f30,plain,
less_than(n14,n15),
inference(cnf_transformation,[],[f1]) ).
fof(f31,plain,
less_than(n15,n16),
inference(cnf_transformation,[],[f1]) ).
fof(f32,plain,
less_than(n16,n17),
inference(cnf_transformation,[],[f1]) ).
fof(f33,plain,
less_than(n17,n18),
inference(cnf_transformation,[],[f1]) ).
fof(f34,plain,
! [X2,X3,X0,X1] :
( goal
| ~ red(X2,X3)
| ~ red(X1,X3)
| ~ red(X0,X3)
| ~ red(X1,X2)
| ~ red(X0,X2)
| ~ red(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f35,plain,
! [X2,X3,X0,X1] :
( goal
| ~ green(X2,X3)
| ~ green(X1,X3)
| ~ green(X0,X3)
| ~ green(X1,X2)
| ~ green(X0,X2)
| ~ green(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f36,plain,
! [X2,X0,X1] :
( less_than(X0,X2)
| ~ less_than(X1,X2)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f37,plain,
! [X0,X1] :
( green(X0,X1)
| red(X0,X1)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f38,plain,
~ goal,
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,plain,
less_than(n17,n18),
inference(cnf_transformation,[],[f33]) ).
cnf(c_50,plain,
less_than(n16,n17),
inference(cnf_transformation,[],[f32]) ).
cnf(c_51,plain,
less_than(n15,n16),
inference(cnf_transformation,[],[f31]) ).
cnf(c_52,plain,
less_than(n14,n15),
inference(cnf_transformation,[],[f30]) ).
cnf(c_53,plain,
less_than(n13,n14),
inference(cnf_transformation,[],[f29]) ).
cnf(c_54,plain,
less_than(n12,n13),
inference(cnf_transformation,[],[f28]) ).
cnf(c_55,plain,
less_than(n11,n12),
inference(cnf_transformation,[],[f27]) ).
cnf(c_56,plain,
less_than(n10,n11),
inference(cnf_transformation,[],[f26]) ).
cnf(c_57,plain,
less_than(n9,n10),
inference(cnf_transformation,[],[f25]) ).
cnf(c_58,plain,
less_than(n8,n9),
inference(cnf_transformation,[],[f24]) ).
cnf(c_59,plain,
less_than(n7,n8),
inference(cnf_transformation,[],[f23]) ).
cnf(c_60,plain,
less_than(n6,n7),
inference(cnf_transformation,[],[f22]) ).
cnf(c_61,plain,
less_than(n5,n6),
inference(cnf_transformation,[],[f21]) ).
cnf(c_62,plain,
less_than(n4,n5),
inference(cnf_transformation,[],[f20]) ).
cnf(c_63,plain,
less_than(n3,n4),
inference(cnf_transformation,[],[f19]) ).
cnf(c_64,plain,
less_than(n2,n3),
inference(cnf_transformation,[],[f18]) ).
cnf(c_65,plain,
less_than(n1,n2),
inference(cnf_transformation,[],[f17]) ).
cnf(c_66,plain,
( ~ red(X0,X1)
| ~ red(X2,X0)
| ~ red(X2,X1)
| ~ red(X3,X0)
| ~ red(X3,X1)
| ~ red(X3,X2)
| goal ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_67,plain,
( ~ green(X0,X1)
| ~ green(X2,X0)
| ~ green(X2,X1)
| ~ green(X3,X0)
| ~ green(X3,X1)
| ~ green(X3,X2)
| goal ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_68,plain,
( ~ less_than(X0,X1)
| ~ less_than(X2,X0)
| less_than(X2,X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_69,plain,
( ~ less_than(X0,X1)
| red(X0,X1)
| green(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_70,negated_conjecture,
~ goal,
inference(cnf_transformation,[],[f38]) ).
cnf(c_74,plain,
( ~ green(X3,X2)
| ~ green(X3,X1)
| ~ green(X3,X0)
| ~ green(X2,X1)
| ~ green(X2,X0)
| ~ green(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_67,c_70,c_67]) ).
cnf(c_75,plain,
( ~ green(X0,X1)
| ~ green(X2,X0)
| ~ green(X2,X1)
| ~ green(X3,X0)
| ~ green(X3,X1)
| ~ green(X3,X2) ),
inference(renaming,[status(thm)],[c_74]) ).
cnf(c_77,plain,
( ~ red(X3,X2)
| ~ red(X3,X1)
| ~ red(X3,X0)
| ~ red(X2,X1)
| ~ red(X2,X0)
| ~ red(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_66,c_70,c_66]) ).
cnf(c_78,plain,
( ~ red(X0,X1)
| ~ red(X2,X0)
| ~ red(X2,X1)
| ~ red(X3,X0)
| ~ red(X3,X1)
| ~ red(X3,X2) ),
inference(renaming,[status(thm)],[c_77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRA019+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n014.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 Aug 27 03:32:02 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 199.17/27.40 % SZS status Started for theBenchmark.p
% 199.17/27.40 % SZS status CounterSatisfiable for theBenchmark.p
% 199.17/27.40
% 199.17/27.40 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 199.17/27.40
% 199.17/27.40 ------ iProver source info
% 199.17/27.40
% 199.17/27.40 git: date: 2023-05-31 18:12:56 +0000
% 199.17/27.40 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 199.17/27.40 git: non_committed_changes: false
% 199.17/27.40 git: last_make_outside_of_git: false
% 199.17/27.40
% 199.17/27.40 ------ Parsing...
% 199.17/27.40 ------ Clausification by vclausify_rel & Parsing by iProver...
% 199.17/27.40
% 199.17/27.40 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 199.17/27.40
% 199.17/27.40 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 199.17/27.40 ------ Proving...
% 199.17/27.40 ------ Problem Properties
% 199.17/27.40
% 199.17/27.40
% 199.17/27.40 clauses 21
% 199.17/27.40 conjectures 0
% 199.17/27.40 EPR 21
% 199.17/27.40 Horn 20
% 199.17/27.40 unary 17
% 199.17/27.40 binary 0
% 199.17/27.40 lits 35
% 199.17/27.40 lits eq 0
% 199.17/27.40 fd_pure 0
% 199.17/27.40 fd_pseudo 0
% 199.17/27.40 fd_cond 0
% 199.17/27.40 fd_pseudo_cond 0
% 199.17/27.40 AC symbols 0
% 199.17/27.40
% 199.17/27.40 ------ Input Options Time Limit: Unbounded
% 199.17/27.40
% 199.17/27.40
% 199.17/27.40 ------
% 199.17/27.40 Current options:
% 199.17/27.40 ------
% 199.17/27.40
% 199.17/27.40
% 199.17/27.40
% 199.17/27.40
% 199.17/27.40 ------ Proving...
% 199.17/27.40
% 199.17/27.40
% 199.17/27.40 % SZS status CounterSatisfiable for theBenchmark.p
% 199.17/27.40
% 199.17/27.40 % SZS output start Saturation for theBenchmark.p
% See solution above
% 199.17/27.40
% 199.17/27.40
%------------------------------------------------------------------------------