TSTP Solution File: COM007+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : COM007+2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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 May 3 02:10:25 EDT 2024
% Result : Theorem 0.46s 1.15s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 55 ( 15 unt; 0 def)
% Number of atoms : 124 ( 20 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 120 ( 51 ~; 54 |; 9 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 45 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( reflexive_rewrite(a,c)
& reflexive_rewrite(a,b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption) ).
fof(f2,axiom,
! [X0] :
( ( reflexive_rewrite(c,X0)
& reflexive_rewrite(b,X0) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_ax) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
=> reflexive_rewrite(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_in_reflexive_rewrite) ).
fof(f4,axiom,
! [X0,X1] :
( rewrite(X0,X1)
=> reflexive_rewrite(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_in_reflexive_rewrite) ).
fof(f5,axiom,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
=> ( rewrite(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_or_rewrite) ).
fof(f6,axiom,
! [X0,X1,X2] :
( ( rewrite(X0,X2)
& rewrite(X0,X1) )
=> ? [X3] :
( rewrite(X2,X3)
& rewrite(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_diamond) ).
fof(f7,conjecture,
goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f8,negated_conjecture,
~ goal,
inference(negated_conjecture,[],[f7]) ).
fof(f9,plain,
~ goal,
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0] :
( goal
| ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f11,plain,
! [X0] :
( goal
| ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
| X0 != X1 ),
inference(ennf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
| ~ rewrite(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1] :
( rewrite(X0,X1)
| X0 = X1
| ~ reflexive_rewrite(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0,X1] :
( rewrite(X0,X1)
| X0 = X1
| ~ reflexive_rewrite(X0,X1) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ? [X3] :
( rewrite(X2,X3)
& rewrite(X1,X3) )
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ? [X3] :
( rewrite(X2,X3)
& rewrite(X1,X3) )
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X1,X2] :
( ? [X3] :
( rewrite(X2,X3)
& rewrite(X1,X3) )
=> ( rewrite(X2,sK0(X1,X2))
& rewrite(X1,sK0(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( rewrite(X2,sK0(X1,X2))
& rewrite(X1,sK0(X1,X2)) )
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f17,f18]) ).
fof(f20,plain,
reflexive_rewrite(a,b),
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
reflexive_rewrite(a,c),
inference(cnf_transformation,[],[f1]) ).
fof(f22,plain,
! [X0] :
( goal
| ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f24,plain,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
| ~ rewrite(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
! [X0,X1] :
( rewrite(X0,X1)
| X0 = X1
| ~ reflexive_rewrite(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X2,X0,X1] :
( rewrite(X1,sK0(X1,X2))
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
! [X2,X0,X1] :
( rewrite(X2,sK0(X1,X2))
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
~ goal,
inference(cnf_transformation,[],[f9]) ).
fof(f29,plain,
! [X1] : reflexive_rewrite(X1,X1),
inference(equality_resolution,[],[f23]) ).
cnf(c_49,plain,
reflexive_rewrite(a,c),
inference(cnf_transformation,[],[f21]) ).
cnf(c_50,plain,
reflexive_rewrite(a,b),
inference(cnf_transformation,[],[f20]) ).
cnf(c_51,plain,
( ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0)
| goal ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_52,plain,
reflexive_rewrite(X0,X0),
inference(cnf_transformation,[],[f29]) ).
cnf(c_53,plain,
( ~ rewrite(X0,X1)
| reflexive_rewrite(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_54,plain,
( ~ reflexive_rewrite(X0,X1)
| X0 = X1
| rewrite(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,plain,
( ~ rewrite(X0,X1)
| ~ rewrite(X0,X2)
| rewrite(X2,sK0(X1,X2)) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_56,plain,
( ~ rewrite(X0,X1)
| ~ rewrite(X0,X2)
| rewrite(X1,sK0(X1,X2)) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_57,negated_conjecture,
~ goal,
inference(cnf_transformation,[],[f28]) ).
cnf(c_62,plain,
( ~ reflexive_rewrite(b,X0)
| ~ reflexive_rewrite(c,X0) ),
inference(global_subsumption_just,[status(thm)],[c_51,c_57,c_51]) ).
cnf(c_63,plain,
( ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0) ),
inference(renaming,[status(thm)],[c_62]) ).
cnf(c_312,plain,
~ reflexive_rewrite(b,c),
inference(superposition,[status(thm)],[c_52,c_63]) ).
cnf(c_319,plain,
( a = c
| rewrite(a,c) ),
inference(superposition,[status(thm)],[c_49,c_54]) ).
cnf(c_320,plain,
( a = b
| rewrite(a,b) ),
inference(superposition,[status(thm)],[c_50,c_54]) ).
cnf(c_337,plain,
( ~ rewrite(a,X0)
| a = c
| rewrite(X0,sK0(c,X0)) ),
inference(superposition,[status(thm)],[c_319,c_55]) ).
cnf(c_348,plain,
( ~ rewrite(a,X0)
| a = c
| rewrite(c,sK0(c,X0)) ),
inference(superposition,[status(thm)],[c_319,c_56]) ).
cnf(c_376,plain,
( ~ rewrite(a,X0)
| a = c
| reflexive_rewrite(X0,sK0(c,X0)) ),
inference(superposition,[status(thm)],[c_337,c_53]) ).
cnf(c_399,plain,
( ~ rewrite(a,X0)
| a = c
| reflexive_rewrite(c,sK0(c,X0)) ),
inference(superposition,[status(thm)],[c_348,c_53]) ).
cnf(c_488,plain,
( ~ reflexive_rewrite(b,sK0(c,X0))
| ~ rewrite(a,X0)
| a = c ),
inference(superposition,[status(thm)],[c_399,c_63]) ).
cnf(c_549,plain,
( ~ rewrite(a,b)
| a = c ),
inference(superposition,[status(thm)],[c_376,c_488]) ).
cnf(c_567,plain,
( a = c
| a = b ),
inference(superposition,[status(thm)],[c_320,c_549]) ).
cnf(c_601,plain,
( ~ reflexive_rewrite(a,c)
| a = c ),
inference(superposition,[status(thm)],[c_567,c_312]) ).
cnf(c_603,plain,
a = c,
inference(forward_subsumption_resolution,[status(thm)],[c_601,c_49]) ).
cnf(c_605,plain,
( ~ reflexive_rewrite(a,X0)
| ~ reflexive_rewrite(b,X0) ),
inference(demodulation,[status(thm)],[c_63,c_603]) ).
cnf(c_613,plain,
~ reflexive_rewrite(a,b),
inference(superposition,[status(thm)],[c_52,c_605]) ).
cnf(c_616,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_613,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : COM007+2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri May 3 00:28:34 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.46/1.15 % SZS status Started for theBenchmark.p
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...
% 0.46/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.46/1.15 ------ Proving...
% 0.46/1.15 ------ Problem Properties
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 clauses 8
% 0.46/1.15 conjectures 0
% 0.46/1.15 EPR 6
% 0.46/1.15 Horn 7
% 0.46/1.15 unary 3
% 0.46/1.15 binary 2
% 0.46/1.15 lits 16
% 0.46/1.15 lits eq 1
% 0.46/1.15 fd_pure 0
% 0.46/1.15 fd_pseudo 0
% 0.46/1.15 fd_cond 0
% 0.46/1.15 fd_pseudo_cond 1
% 0.46/1.15 AC symbols 0
% 0.46/1.15
% 0.46/1.15 ------ Schedule dynamic 5 is on
% 0.46/1.15
% 0.46/1.15 ------ no conjectures: strip conj schedule
% 0.46/1.15
% 0.46/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------
% 0.46/1.15 Current options:
% 0.46/1.15 ------
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Proving...
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15
% 0.46/1.15
%------------------------------------------------------------------------------