TSTP Solution File: SYN075+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN075+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 : Mon Jun 24 19:37:16 EDT 2024
% Result : Theorem 1.95s 1.17s
% Output : CNFRefutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 5 unt; 0 def)
% Number of atoms : 192 ( 116 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 236 ( 92 ~; 101 |; 30 &)
% ( 8 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 110 ( 2 sgn 53 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0,X1] :
! [X2,X3] :
( big_f(X2,X3)
<=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel52_1) ).
fof(f2,conjecture,
? [X1] :
! [X3] :
( ? [X0] :
! [X2] :
( big_f(X2,X3)
<=> X0 = X2 )
<=> X1 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel52) ).
fof(f3,negated_conjecture,
~ ? [X1] :
! [X3] :
( ? [X0] :
! [X2] :
( big_f(X2,X3)
<=> X0 = X2 )
<=> X1 = X3 ),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
~ ? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X2 = X3 )
<=> X0 = X1 ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
! [X0] :
? [X1] :
( ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X2 = X3 )
<~> X0 = X1 ),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
? [X0,X1] :
! [X2,X3] :
( ( big_f(X2,X3)
| X1 != X3
| X0 != X2 )
& ( ( X1 = X3
& X0 = X2 )
| ~ big_f(X2,X3) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f7,plain,
? [X0,X1] :
! [X2,X3] :
( ( big_f(X2,X3)
| X1 != X3
| X0 != X2 )
& ( ( X1 = X3
& X0 = X2 )
| ~ big_f(X2,X3) ) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
( ? [X0,X1] :
! [X2,X3] :
( ( big_f(X2,X3)
| X1 != X3
| X0 != X2 )
& ( ( X1 = X3
& X0 = X2 )
| ~ big_f(X2,X3) ) )
=> ! [X3,X2] :
( ( big_f(X2,X3)
| sK1 != X3
| sK0 != X2 )
& ( ( sK1 = X3
& sK0 = X2 )
| ~ big_f(X2,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X2,X3] :
( ( big_f(X2,X3)
| sK1 != X3
| sK0 != X2 )
& ( ( sK1 = X3
& sK0 = X2 )
| ~ big_f(X2,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).
fof(f10,plain,
! [X0] :
? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) ) )
& ( X0 = X1
| ? [X2] :
! [X3] :
( ( big_f(X3,X1)
| X2 != X3 )
& ( X2 = X3
| ~ big_f(X3,X1) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f11,plain,
! [X0] :
? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) ) )
& ( X0 = X1
| ? [X4] :
! [X5] :
( ( big_f(X5,X1)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,X1) ) ) ) ),
inference(rectify,[],[f10]) ).
fof(f12,plain,
! [X0] :
( ? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) ) )
& ( X0 = X1
| ? [X4] :
! [X5] :
( ( big_f(X5,X1)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,X1) ) ) ) )
=> ( ( sK2(X0) != X0
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK2(X0)) )
& ( X2 = X3
| big_f(X3,sK2(X0)) ) ) )
& ( sK2(X0) = X0
| ? [X4] :
! [X5] :
( ( big_f(X5,sK2(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK2(X0)) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X2] :
( ? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK2(X0)) )
& ( X2 = X3
| big_f(X3,sK2(X0)) ) )
=> ( ( sK3(X0,X2) != X2
| ~ big_f(sK3(X0,X2),sK2(X0)) )
& ( sK3(X0,X2) = X2
| big_f(sK3(X0,X2),sK2(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X0] :
( ? [X4] :
! [X5] :
( ( big_f(X5,sK2(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK2(X0)) ) )
=> ! [X5] :
( ( big_f(X5,sK2(X0))
| sK4(X0) != X5 )
& ( sK4(X0) = X5
| ~ big_f(X5,sK2(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ( sK2(X0) != X0
| ! [X2] :
( ( sK3(X0,X2) != X2
| ~ big_f(sK3(X0,X2),sK2(X0)) )
& ( sK3(X0,X2) = X2
| big_f(sK3(X0,X2),sK2(X0)) ) ) )
& ( sK2(X0) = X0
| ! [X5] :
( ( big_f(X5,sK2(X0))
| sK4(X0) != X5 )
& ( sK4(X0) = X5
| ~ big_f(X5,sK2(X0)) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f11,f14,f13,f12]) ).
fof(f16,plain,
! [X2,X3] :
( sK0 = X2
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
! [X2,X3] :
( sK1 = X3
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
! [X2,X3] :
( big_f(X2,X3)
| sK1 != X3
| sK0 != X2 ),
inference(cnf_transformation,[],[f9]) ).
fof(f20,plain,
! [X0,X5] :
( sK2(X0) = X0
| big_f(X5,sK2(X0))
| sK4(X0) != X5 ),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
! [X2,X0] :
( sK2(X0) != X0
| sK3(X0,X2) = X2
| big_f(sK3(X0,X2),sK2(X0)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
! [X2,X0] :
( sK2(X0) != X0
| sK3(X0,X2) != X2
| ~ big_f(sK3(X0,X2),sK2(X0)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
! [X2] :
( big_f(X2,sK1)
| sK0 != X2 ),
inference(equality_resolution,[],[f18]) ).
fof(f24,plain,
big_f(sK0,sK1),
inference(equality_resolution,[],[f23]) ).
fof(f25,plain,
! [X0] :
( sK2(X0) = X0
| big_f(sK4(X0),sK2(X0)) ),
inference(equality_resolution,[],[f20]) ).
cnf(c_49,plain,
big_f(sK0,sK1),
inference(cnf_transformation,[],[f24]) ).
cnf(c_50,plain,
( ~ big_f(X0,X1)
| X1 = sK1 ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_51,plain,
( ~ big_f(X0,X1)
| X0 = sK0 ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_52,negated_conjecture,
( sK3(X0,X1) != X1
| sK2(X0) != X0
| ~ big_f(sK3(X0,X1),sK2(X0)) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_53,negated_conjecture,
( sK2(X0) != X0
| sK3(X0,X1) = X1
| big_f(sK3(X0,X1),sK2(X0)) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_54,negated_conjecture,
( sK2(X0) = X0
| big_f(sK4(X0),sK2(X0)) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_300,negated_conjecture,
( sK2(X0) = X0
| big_f(sK4(X0),sK2(X0)) ),
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_301,negated_conjecture,
( sK2(X0) != X0
| sK3(X0,X1) = X1
| big_f(sK3(X0,X1),sK2(X0)) ),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_302,negated_conjecture,
( sK3(X0,X1) != X1
| sK2(X0) != X0
| ~ big_f(sK3(X0,X1),sK2(X0)) ),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_306,plain,
( X0 != X1
| X2 != X3
| ~ big_f(X1,X3)
| big_f(X0,X2) ),
theory(equality) ).
cnf(c_433,plain,
( sK2(X0) = X0
| sK2(X0) = sK1 ),
inference(superposition,[status(thm)],[c_300,c_50]) ).
cnf(c_450,plain,
( X0 != sK1
| sK2(X0) = sK1 ),
inference(equality_factoring,[status(thm)],[c_433]) ).
cnf(c_485,plain,
sK2(sK1) = sK1,
inference(equality_resolution,[status(thm)],[c_450]) ).
cnf(c_526,plain,
( X0 != sK0
| X1 != sK1
| ~ big_f(sK0,sK1)
| big_f(X0,X1) ),
inference(instantiation,[status(thm)],[c_306]) ).
cnf(c_529,plain,
( sK3(sK1,X0) = X0
| big_f(sK3(sK1,X0),sK2(sK1)) ),
inference(superposition,[status(thm)],[c_485,c_301]) ).
cnf(c_532,plain,
( sK3(sK1,X0) = X0
| big_f(sK3(sK1,X0),sK1) ),
inference(light_normalisation,[status(thm)],[c_529,c_485]) ).
cnf(c_540,plain,
( sK2(sK1) != sK1
| X0 != sK0
| ~ big_f(sK0,sK1)
| big_f(X0,sK2(sK1)) ),
inference(instantiation,[status(thm)],[c_526]) ).
cnf(c_558,plain,
( sK3(sK1,X0) = X0
| sK3(sK1,X0) = sK0 ),
inference(superposition,[status(thm)],[c_532,c_51]) ).
cnf(c_566,plain,
sK3(sK1,sK0) = sK0,
inference(instantiation,[status(thm)],[c_558]) ).
cnf(c_682,plain,
( sK3(sK1,X0) != sK0
| sK2(sK1) != sK1
| ~ big_f(sK0,sK1)
| big_f(sK3(sK1,X0),sK2(sK1)) ),
inference(instantiation,[status(thm)],[c_540]) ).
cnf(c_683,plain,
( sK3(sK1,X0) != X0
| sK2(sK1) != sK1
| ~ big_f(sK3(sK1,X0),sK2(sK1)) ),
inference(instantiation,[status(thm)],[c_302]) ).
cnf(c_684,plain,
( sK3(sK1,sK0) != sK0
| sK2(sK1) != sK1
| ~ big_f(sK0,sK1)
| big_f(sK3(sK1,sK0),sK2(sK1)) ),
inference(instantiation,[status(thm)],[c_682]) ).
cnf(c_685,plain,
( sK3(sK1,sK0) != sK0
| sK2(sK1) != sK1
| ~ big_f(sK3(sK1,sK0),sK2(sK1)) ),
inference(instantiation,[status(thm)],[c_683]) ).
cnf(c_686,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_685,c_684,c_566,c_485,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN075+1 : TPTP v8.2.0. Released v2.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Jun 23 23:17:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 1.95/1.17 % SZS status Started for theBenchmark.p
% 1.95/1.17 % SZS status Theorem for theBenchmark.p
% 1.95/1.17
% 1.95/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.95/1.17
% 1.95/1.17 ------ iProver source info
% 1.95/1.17
% 1.95/1.17 git: date: 2024-06-12 09:56:46 +0000
% 1.95/1.17 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 1.95/1.17 git: non_committed_changes: false
% 1.95/1.17
% 1.95/1.17 ------ Parsing...
% 1.95/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.95/1.17
% 1.95/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.95/1.17
% 1.95/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.95/1.17
% 1.95/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.95/1.17 ------ Proving...
% 1.95/1.17 ------ Problem Properties
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17 clauses 7
% 1.95/1.17 conjectures 4
% 1.95/1.17 EPR 3
% 1.95/1.17 Horn 4
% 1.95/1.17 unary 1
% 1.95/1.17 binary 3
% 1.95/1.17 lits 16
% 1.95/1.17 lits eq 9
% 1.95/1.17 fd_pure 0
% 1.95/1.17 fd_pseudo 0
% 1.95/1.17 fd_cond 2
% 1.95/1.17 fd_pseudo_cond 0
% 1.95/1.17 AC symbols 0
% 1.95/1.17
% 1.95/1.17 ------ Schedule dynamic 5 is on
% 1.95/1.17
% 1.95/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17 ------
% 1.95/1.17 Current options:
% 1.95/1.17 ------
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17 ------ Proving...
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17 % SZS status Theorem for theBenchmark.p
% 1.95/1.17
% 1.95/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.95/1.17
% 1.95/1.17
%------------------------------------------------------------------------------