TSTP Solution File: KLE089+1 by iProver---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.5
% Problem : KLE089+1 : TPTP v7.5.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 prover_driver.py --schedule_mode external --schedule fof_schedule --no_cores 8 %s %d
% 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 : 3000s
% DateTime : Thu Jun 3 18:56:29 EDT 2021
% Result : Theorem 3.48s
% Output : CNFRefutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 38 unt; 0 def)
% Number of atoms : 52 ( 51 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 0 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 35 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,conjecture,
! [X3,X4] :
( addition(domain(X3),antidomain(X4)) = antidomain(X4)
=> zero = multiplication(domain(X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f22,negated_conjecture,
~ ! [X3,X4] :
( addition(domain(X3),antidomain(X4)) = antidomain(X4)
=> zero = multiplication(domain(X3),X4) ),
inference(negated_conjecture,[],[f21]) ).
fof(f32,plain,
~ ! [X0,X1] :
( addition(domain(X0),antidomain(X1)) = antidomain(X1)
=> zero = multiplication(domain(X0),X1) ),
inference(rectify,[],[f22]) ).
fof(f33,plain,
? [X0,X1] :
( zero != multiplication(domain(X0),X1)
& addition(domain(X0),antidomain(X1)) = antidomain(X1) ),
inference(ennf_transformation,[],[f32]) ).
fof(f34,plain,
( ? [X0,X1] :
( zero != multiplication(domain(X0),X1)
& addition(domain(X0),antidomain(X1)) = antidomain(X1) )
=> ( zero != multiplication(domain(sK0),sK1)
& addition(domain(sK0),antidomain(sK1)) = antidomain(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
( zero != multiplication(domain(sK0),sK1)
& addition(domain(sK0),antidomain(sK1)) = antidomain(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f33,f34]) ).
fof(f55,plain,
addition(domain(sK0),antidomain(sK1)) = antidomain(sK1),
inference(cnf_transformation,[],[f35]) ).
fof(f16,axiom,
! [X3] : antidomain(antidomain(X3)) = domain(X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f27,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(rectify,[],[f16]) ).
fof(f50,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(cnf_transformation,[],[f27]) ).
fof(f58,plain,
addition(antidomain(antidomain(sK0)),antidomain(sK1)) = antidomain(sK1),
inference(definition_unfolding,[],[f55,f50]) ).
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f23,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f37,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f23]) ).
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f36,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f39,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f13,axiom,
! [X3] : zero = multiplication(antidomain(X3),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f24,plain,
! [X0] : zero = multiplication(antidomain(X0),X0),
inference(rectify,[],[f13]) ).
fof(f47,plain,
! [X0] : zero = multiplication(antidomain(X0),X0),
inference(cnf_transformation,[],[f24]) ).
fof(f9,axiom,
! [X0,X1,X2] : addition(multiplication(X0,X2),multiplication(X1,X2)) = multiplication(addition(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f44,plain,
! [X2,X0,X1] : addition(multiplication(X0,X2),multiplication(X1,X2)) = multiplication(addition(X0,X1),X2),
inference(cnf_transformation,[],[f9]) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f38,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f56,plain,
zero != multiplication(domain(sK0),sK1),
inference(cnf_transformation,[],[f35]) ).
fof(f57,plain,
zero != multiplication(antidomain(antidomain(sK0)),sK1),
inference(definition_unfolding,[],[f56,f50]) ).
cnf(c_18,negated_conjecture,
addition(antidomain(antidomain(sK0)),antidomain(sK1)) = antidomain(sK1),
inference(cnf_transformation,[],[f58]) ).
cnf(c_1,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f37]) ).
cnf(c_0,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f36]) ).
cnf(c_36,negated_conjecture,
addition(antidomain(sK1),antidomain(antidomain(sK0))) = antidomain(sK1),
inference(theory_normalisation,[status(thm)],[c_18,c_1,c_0]) ).
cnf(c_3,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f39]) ).
cnf(c_83,plain,
addition(X0,addition(X1,X2)) = addition(X1,addition(X2,X0)),
inference(superposition,[status(thm)],[c_1,c_0]) ).
cnf(c_509,plain,
addition(X0,addition(X1,X0)) = addition(X1,X0),
inference(superposition,[status(thm)],[c_3,c_83]) ).
cnf(c_4057,plain,
addition(antidomain(antidomain(sK0)),antidomain(sK1)) = antidomain(sK1),
inference(superposition,[status(thm)],[c_36,c_509]) ).
cnf(c_11,plain,
multiplication(antidomain(X0),X0) = zero,
inference(cnf_transformation,[],[f47]) ).
cnf(c_8,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f44]) ).
cnf(c_189,plain,
multiplication(addition(X0,antidomain(X1)),X1) = addition(multiplication(X0,X1),zero),
inference(superposition,[status(thm)],[c_11,c_8]) ).
cnf(c_2,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f38]) ).
cnf(c_191,plain,
multiplication(addition(X0,antidomain(X1)),X1) = multiplication(X0,X1),
inference(demodulation,[status(thm)],[c_189,c_2]) ).
cnf(c_5826,plain,
multiplication(antidomain(antidomain(sK0)),sK1) = multiplication(antidomain(sK1),sK1),
inference(superposition,[status(thm)],[c_4057,c_191]) ).
cnf(c_5829,plain,
multiplication(antidomain(antidomain(sK0)),sK1) = zero,
inference(demodulation,[status(thm)],[c_5826,c_11]) ).
cnf(c_17,negated_conjecture,
multiplication(antidomain(antidomain(sK0)),sK1) != zero,
inference(cnf_transformation,[],[f57]) ).
cnf(c_5830,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5829,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE089+1 : TPTP v7.5.0. Released v4.0.0.
% 0.12/0.13 % Command : python3 prover_driver.py --schedule_mode external --schedule fof_schedule --no_cores 8 %s %d
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 3000
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Jun 1 02:19:34 EDT 2021
% 0.14/0.34 % CPUTime :
% 0.14/0.34 % Running in SAT mode
% 3.48/1.11 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.48/1.11 warning: lib.ml: dbg_global_flag=false
% 3.48/1.11
% 3.48/1.11 %---------------- iProver v3.5 (pre CASC-28 2021) ----------------%
% 3.48/1.11
% 3.48/1.11 warning: SMTSolver_Dummy: dbg_flag=true
% 3.48/1.11 warning: perfectDiscrTree: dbg_flag=true
% 3.48/1.11 warning: prop_lit_to_fof_flag: true
% 3.48/1.11 warning: demodulationIndex: false
% 3.48/1.11 warning: demodulationIndex fwd_only_orientable_flag: false
% 3.48/1.11 warning: lightNormalisationIndex:use_non_ground true
% 3.48/1.11 warning: simplify_new: dbg_flag=true
% 3.48/1.11 warning: resolution_loop: dbg_flag=true
% 3.48/1.11 warning: use_rec_defs_flag: true
% 3.48/1.11 warning: def_merge_tr_red_non_prop_flag: true
% 3.48/1.11 warning: !!! set_of_support_flag = true, sos_shift_only_out_of_phase_flag = true
% 3.48/1.11
% 3.48/1.11 warning: instantiation_loop:sth_get_sel_lits_in_phase_solver_consist
% 3.48/1.11 warning: finite_models commented: preprocess_after_flattening
% 3.48/1.11 warning: Superposition_scores: dbg_flag=true
% 3.48/1.11 warning: when_born_iter_flag: true
% 3.48/1.11 warning: proof_search_loop: dbg_flag=true
% 3.48/1.11 warning: proof_search_loop: ps_stagnation_limit:1000
% 3.48/1.11 warning: ar_dbg: dbg_flag=true
% 3.48/1.11 warning: pred_elim_qbf: true
% 3.48/1.11 warning: dbg_qbf_res_prep_flag: true
% 3.48/1.11 ------ iProver source info
% 3.48/1.11
% 3.48/1.11 git: date: 2021-05-28 16:58:14 +0100
% 3.48/1.11 git: sha1: e59f531ca0c437769fd594dd26ba89f51e536e3d
% 3.48/1.11 git: non_committed_changes: false
% 3.48/1.11 git: last_make_outside_of_git: false
% 3.48/1.11
% 3.48/1.11 ------ Parsing...
% 3.48/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.48/1.11
% 3.48/1.11 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.48/1.11
% 3.48/1.11 ------ Preprocessing... scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e
% 3.48/1.11
% 3.48/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.48/1.11 ------ Proving...
% 3.48/1.11 ------ Problem Properties
% 3.48/1.11
% 3.48/1.11
% 3.48/1.11 clauses 19
% 3.48/1.11 conjectures 2
% 3.48/1.11 EPR 0
% 3.48/1.11 Horn 19
% 3.48/1.11 unary 19
% 3.48/1.11 binary 0
% 3.48/1.11 lits 19
% 3.48/1.11 lits eq 19
% 3.48/1.11 fd_pure 0
% 3.48/1.11 fd_pseudo 0
% 3.48/1.11 fd_cond 0
% 3.48/1.11 fd_pseudo_cond 0
% 3.48/1.11 AC symbols 1
% 3.48/1.11
% 3.48/1.11 ------ Input Options Time Limit: Unbounded
% 3.48/1.11
% 3.48/1.11
% 3.48/1.11 ------
% 3.48/1.11 Current options:
% 3.48/1.11 ------
% 3.48/1.11
% 3.48/1.11
% 3.48/1.11
% 3.48/1.11
% 3.48/1.11 ------ Proving...
% 3.48/1.11
% 3.48/1.11
% 3.48/1.11 % SZS status Theorem for theBenchmark.p
% 3.48/1.11
% 3.48/1.11 Resolution empty clause
% 3.48/1.11
% 3.48/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.48/1.11 % SZS output end CNFRefutation for theBenchmark.p
% 3.48/1.11
% 3.48/1.11 ------ Statistics
% 3.48/1.11
% 3.48/1.11 ------ Selected
% 3.48/1.11
% 3.48/1.11 total_time: 0.23
% 3.48/1.11
% 3.48/1.12 ulimit: Command not found.
%------------------------------------------------------------------------------