TSTP Solution File: SYN335+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN335+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 Sep 1 03:06:28 EDT 2023
% Result : CounterSatisfiable 0.48s 1.17s
% Output : Saturation 0.48s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0,X1] :
! [X2] :
( big_f(X0,X2)
=> ( ( ( big_f(X2,X2)
=> big_g(X2,X2) )
<=> big_f(X0,X1) )
=> ( ( ( big_g(X2,X2)
=> big_f(X2,X2) )
<=> big_g(X0,X1) )
=> ( ( ( big_g(X0,X1)
=> big_f(X1,X0) )
<=> big_g(X1,X2) )
=> ( big_f(X2,X1)
<=> big_f(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_14_7) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2] :
( big_f(X0,X2)
=> ( ( ( big_f(X2,X2)
=> big_g(X2,X2) )
<=> big_f(X0,X1) )
=> ( ( ( big_g(X2,X2)
=> big_f(X2,X2) )
<=> big_g(X0,X1) )
=> ( ( ( big_g(X0,X1)
=> big_f(X1,X0) )
<=> big_g(X1,X2) )
=> ( big_f(X2,X1)
<=> big_f(X1,X0) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
! [X0,X1] :
? [X2] :
( ( big_f(X2,X1)
<~> big_f(X1,X0) )
& ( ( big_f(X1,X0)
| ~ big_g(X0,X1) )
<=> big_g(X1,X2) )
& ( ( big_f(X2,X2)
| ~ big_g(X2,X2) )
<=> big_g(X0,X1) )
& ( ( big_g(X2,X2)
| ~ big_f(X2,X2) )
<=> big_f(X0,X1) )
& big_f(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0,X1] :
? [X2] :
( ( big_f(X2,X1)
<~> big_f(X1,X0) )
& ( ( big_f(X1,X0)
| ~ big_g(X0,X1) )
<=> big_g(X1,X2) )
& ( ( big_f(X2,X2)
| ~ big_g(X2,X2) )
<=> big_g(X0,X1) )
& ( ( big_g(X2,X2)
| ~ big_f(X2,X2) )
<=> big_f(X0,X1) )
& big_f(X0,X2) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X1) )
& ( big_f(X1,X0)
| big_f(X2,X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,X2) )
& ( big_g(X1,X2)
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(X2,X2)
| ~ big_g(X2,X2)
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(X2,X2)
& big_g(X2,X2) ) )
& ( big_g(X2,X2)
| ~ big_f(X2,X2)
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(X2,X2)
& big_f(X2,X2) ) )
& big_f(X0,X2) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X1) )
& ( big_f(X1,X0)
| big_f(X2,X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,X2) )
& ( big_g(X1,X2)
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(X2,X2)
| ~ big_g(X2,X2)
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(X2,X2)
& big_g(X2,X2) ) )
& ( big_g(X2,X2)
| ~ big_f(X2,X2)
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(X2,X2)
& big_f(X2,X2) ) )
& big_f(X0,X2) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X1) )
& ( big_f(X1,X0)
| big_f(X2,X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,X2) )
& ( big_g(X1,X2)
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(X2,X2)
| ~ big_g(X2,X2)
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(X2,X2)
& big_g(X2,X2) ) )
& ( big_g(X2,X2)
| ~ big_f(X2,X2)
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(X2,X2)
& big_f(X2,X2) ) )
& big_f(X0,X2) )
=> ( ( ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),X1) )
& ( big_f(X1,X0)
| big_f(sK0(X0,X1),X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,sK0(X0,X1)) )
& ( big_g(X1,sK0(X0,X1))
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
& big_g(sK0(X0,X1),sK0(X0,X1)) ) )
& ( big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
& big_f(sK0(X0,X1),sK0(X0,X1)) ) )
& big_f(X0,sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0,X1] :
( ( ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),X1) )
& ( big_f(X1,X0)
| big_f(sK0(X0,X1),X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,sK0(X0,X1)) )
& ( big_g(X1,sK0(X0,X1))
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
& big_g(sK0(X0,X1),sK0(X0,X1)) ) )
& ( big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
& big_f(sK0(X0,X1),sK0(X0,X1)) ) )
& big_f(X0,sK0(X0,X1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f9,plain,
! [X0,X1] : big_f(X0,sK0(X0,X1)),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( big_f(X0,X1)
| big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0,X1] :
( big_f(X0,X1)
| ~ big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X0,X1] :
( big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( big_g(X0,X1)
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( big_g(X0,X1)
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
! [X0,X1] :
( big_g(X1,sK0(X0,X1))
| big_g(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f17,plain,
! [X0,X1] :
( big_g(X1,sK0(X0,X1))
| ~ big_f(X1,X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0,X1] :
( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f19,plain,
! [X0,X1] :
( big_f(X1,X0)
| big_f(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f20,plain,
! [X0,X1] :
( ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ big_f(sK0(X0,X1),X1)
| ~ big_f(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_50,negated_conjecture,
( big_f(sK0(X0,X1),X1)
| big_f(X1,X0) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_51,negated_conjecture,
( ~ big_g(X0,sK0(X1,X0))
| ~ big_g(X1,X0)
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_52,negated_conjecture,
( ~ big_f(X0,X1)
| big_g(X0,sK0(X1,X0)) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_53,negated_conjecture,
( big_g(X0,sK0(X1,X0))
| big_g(X1,X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_54,negated_conjecture,
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1)
| big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_55,negated_conjecture,
( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| big_g(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_56,negated_conjecture,
( big_g(sK0(X0,X1),sK0(X0,X1))
| big_g(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_57,negated_conjecture,
( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1)
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_58,negated_conjecture,
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_59,negated_conjecture,
( big_f(sK0(X0,X1),sK0(X0,X1))
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_60,negated_conjecture,
big_f(X0,sK0(X0,X1)),
inference(cnf_transformation,[],[f9]) ).
cnf(c_183,plain,
( ~ big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_187,plain,
( big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_410,plain,
( big_f(X0,X1)
| big_g(X0,X1) ),
inference(superposition,[status(thm)],[c_59,c_55]) ).
cnf(c_468,plain,
( ~ big_g(X0,X1)
| big_f(X1,sK0(X0,X1))
| big_f(X1,X0) ),
inference(superposition,[status(thm)],[c_410,c_51]) ).
cnf(c_505,negated_conjecture,
( ~ big_g(X0,X1)
| big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_54,c_54,c_183,c_187]) ).
cnf(c_529,negated_conjecture,
( ~ big_f(X0,X1)
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_56,c_57,c_505]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN335+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 17:57:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.17 % SZS status Started for theBenchmark.p
% 0.48/1.17 % SZS status CounterSatisfiable for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.17
% 0.48/1.17 ------ iProver source info
% 0.48/1.17
% 0.48/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.17 git: non_committed_changes: false
% 0.48/1.17 git: last_make_outside_of_git: false
% 0.48/1.17
% 0.48/1.17 ------ Parsing...
% 0.48/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.17 ------ Proving...
% 0.48/1.17 ------ Problem Properties
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 clauses 12
% 0.48/1.17 conjectures 12
% 0.48/1.17 EPR 0
% 0.48/1.17 Horn 8
% 0.48/1.17 unary 1
% 0.48/1.17 binary 8
% 0.48/1.17 lits 26
% 0.48/1.17 lits eq 0
% 0.48/1.17 fd_pure 0
% 0.48/1.17 fd_pseudo 0
% 0.48/1.17 fd_cond 0
% 0.48/1.17 fd_pseudo_cond 0
% 0.48/1.17 AC symbols 0
% 0.48/1.17
% 0.48/1.17 ------ Schedule dynamic 5 is on
% 0.48/1.17
% 0.48/1.17 ------ no equalities: superposition off
% 0.48/1.17
% 0.48/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------
% 0.48/1.17 Current options:
% 0.48/1.17 ------
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Proving...
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 % SZS status CounterSatisfiable for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.48/1.17
% 0.48/1.18
%------------------------------------------------------------------------------