TSTP Solution File: SWV415+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV415+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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 22:32:56 EDT 2023
% Result : Theorem 3.80s 1.20s
% Output : CNFRefutation 3.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 21 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 81 ( 22 sgn; 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0,X1,X2,X3] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f55,axiom,
! [X0,X1,X2,X3,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f63,axiom,
! [X0,X1,X2,X3,X4] : i(triple(X0,X2,X3)) = i(triple(X1,X2,X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main2_l12) ).
fof(f64,conjecture,
! [X0,X1,X2,X3] : insert_pq(i(triple(X0,X1,X2)),X3) = i(insert_cpq(triple(X0,X1,X2),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co2) ).
fof(f65,negated_conjecture,
~ ! [X0,X1,X2,X3] : insert_pq(i(triple(X0,X1,X2)),X3) = i(insert_cpq(triple(X0,X1,X2),X3)),
inference(negated_conjecture,[],[f64]) ).
fof(f116,plain,
? [X0,X1,X2,X3] : insert_pq(i(triple(X0,X1,X2)),X3) != i(insert_cpq(triple(X0,X1,X2),X3)),
inference(ennf_transformation,[],[f65]) ).
fof(f127,plain,
( ? [X0,X1,X2,X3] : insert_pq(i(triple(X0,X1,X2)),X3) != i(insert_cpq(triple(X0,X1,X2),X3))
=> insert_pq(i(triple(sK1,sK2,sK3)),sK4) != i(insert_cpq(triple(sK1,sK2,sK3),sK4)) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
insert_pq(i(triple(sK1,sK2,sK3)),sK4) != i(insert_cpq(triple(sK1,sK2,sK3),sK4)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f116,f127]) ).
fof(f180,plain,
! [X2,X3,X0,X1] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
inference(cnf_transformation,[],[f42]) ).
fof(f193,plain,
! [X2,X3,X0,X1,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
inference(cnf_transformation,[],[f55]) ).
fof(f194,plain,
! [X2,X3,X0,X1,X4] : i(triple(X0,X2,X3)) = i(triple(X1,X2,X4)),
inference(cnf_transformation,[],[f63]) ).
fof(f195,plain,
insert_pq(i(triple(sK1,sK2,sK3)),sK4) != i(insert_cpq(triple(sK1,sK2,sK3),sK4)),
inference(cnf_transformation,[],[f128]) ).
cnf(c_100,plain,
triple(insert_pqp(X0,X1),insert_slb(X2,pair(X1,bottom)),X3) = insert_cpq(triple(X0,X2,X3),X1),
inference(cnf_transformation,[],[f180]) ).
cnf(c_111,plain,
i(triple(X0,insert_slb(X1,pair(X2,X3)),X4)) = insert_pq(i(triple(X0,X1,X4)),X2),
inference(cnf_transformation,[],[f193]) ).
cnf(c_112,plain,
i(triple(X0,X1,X2)) = i(triple(X3,X1,X4)),
inference(cnf_transformation,[],[f194]) ).
cnf(c_113,negated_conjecture,
insert_pq(i(triple(sK1,sK2,sK3)),sK4) != i(insert_cpq(triple(sK1,sK2,sK3),sK4)),
inference(cnf_transformation,[],[f195]) ).
cnf(c_2818,plain,
i(triple(X0,insert_slb(X1,pair(X2,bottom)),X3)) = i(insert_cpq(triple(X4,X1,X5),X2)),
inference(superposition,[status(thm)],[c_100,c_112]) ).
cnf(c_2841,plain,
i(triple(X0,insert_slb(X1,pair(X2,X3)),X4)) = insert_pq(i(triple(X5,X1,X6)),X2),
inference(superposition,[status(thm)],[c_111,c_112]) ).
cnf(c_6471,plain,
i(insert_cpq(triple(X0,X1,X2),X3)) = i(insert_cpq(triple(X4,X1,X5),X3)),
inference(superposition,[status(thm)],[c_2818,c_2818]) ).
cnf(c_6518,plain,
i(insert_cpq(triple(X0,sK2,X1),sK4)) != insert_pq(i(triple(sK1,sK2,sK3)),sK4),
inference(superposition,[status(thm)],[c_6471,c_113]) ).
cnf(c_6524,plain,
i(triple(X0,insert_slb(sK2,pair(sK4,bottom)),X1)) != insert_pq(i(triple(sK1,sK2,sK3)),sK4),
inference(superposition,[status(thm)],[c_2818,c_6518]) ).
cnf(c_6828,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_6524,c_2841]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV415+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.18/0.35 % Computer : n031.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Tue Aug 29 09:32:11 EDT 2023
% 0.18/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.80/1.20 % SZS status Started for theBenchmark.p
% 3.80/1.20 % SZS status Theorem for theBenchmark.p
% 3.80/1.20
% 3.80/1.20 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.80/1.20
% 3.80/1.20 ------ iProver source info
% 3.80/1.20
% 3.80/1.20 git: date: 2023-05-31 18:12:56 +0000
% 3.80/1.20 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.80/1.20 git: non_committed_changes: false
% 3.80/1.20 git: last_make_outside_of_git: false
% 3.80/1.20
% 3.80/1.20 ------ Parsing...
% 3.80/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.80/1.20
% 3.80/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 3.80/1.20
% 3.80/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.80/1.20
% 3.80/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.80/1.20 ------ Proving...
% 3.80/1.20 ------ Problem Properties
% 3.80/1.20
% 3.80/1.20
% 3.80/1.20 clauses 57
% 3.80/1.20 conjectures 1
% 3.80/1.20 EPR 7
% 3.80/1.20 Horn 40
% 3.80/1.20 unary 24
% 3.80/1.20 binary 15
% 3.80/1.20 lits 109
% 3.80/1.20 lits eq 42
% 3.80/1.20 fd_pure 0
% 3.80/1.20 fd_pseudo 0
% 3.80/1.20 fd_cond 5
% 3.80/1.20 fd_pseudo_cond 7
% 3.80/1.20 AC symbols 0
% 3.80/1.20
% 3.80/1.20 ------ Schedule dynamic 5 is on
% 3.80/1.20
% 3.80/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.80/1.20
% 3.80/1.20
% 3.80/1.20 ------
% 3.80/1.20 Current options:
% 3.80/1.20 ------
% 3.80/1.20
% 3.80/1.20
% 3.80/1.20
% 3.80/1.20
% 3.80/1.20 ------ Proving...
% 3.80/1.20
% 3.80/1.20
% 3.80/1.20 % SZS status Theorem for theBenchmark.p
% 3.80/1.20
% 3.80/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.80/1.20
% 3.80/1.20
%------------------------------------------------------------------------------