TSTP Solution File: DAT002_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT002_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:14:10 EDT 2024
% Result : Theorem 3.53s 1.14s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : DAT002_1 : TPTP v8.1.2. Released v5.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 18:43:11 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running TFA theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.53/1.14 % SZS status Started for theBenchmark.p
% 3.53/1.14 % SZS status Theorem for theBenchmark.p
% 3.53/1.14
% 3.53/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.53/1.14
% 3.53/1.14 ------ iProver source info
% 3.53/1.14
% 3.53/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.53/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.53/1.14 git: non_committed_changes: false
% 3.53/1.14
% 3.53/1.14 ------ Parsing...
% 3.53/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.53/1.14
% 3.53/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.53/1.14
% 3.53/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.53/1.14
% 3.53/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.53/1.14 ------ Proving...
% 3.53/1.14 ------ Problem Properties
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 clauses 21
% 3.53/1.14 conjectures 1
% 3.53/1.14 EPR 9
% 3.53/1.14 Horn 18
% 3.53/1.14 unary 15
% 3.53/1.14 binary 3
% 3.53/1.14 lits 31
% 3.53/1.14 lits eq 7
% 3.53/1.14 fd_pure 0
% 3.53/1.14 fd_pseudo 0
% 3.53/1.14 fd_cond 0
% 3.53/1.14 fd_pseudo_cond 1
% 3.53/1.14 AC symbols 1
% 3.53/1.14
% 3.53/1.14 ------ Input Options Time Limit: Unbounded
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 ------
% 3.53/1.14 Current options:
% 3.53/1.14 ------
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 ------ Proving...
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 % SZS status Theorem for theBenchmark.p
% 3.53/1.14
% 3.53/1.14 % SZS output start CNFRefutation for theBenchmark.p
% 3.53/1.14
% 3.53/1.14 tff(f3,axiom,(
% 3.53/1.14 ! [X0 : $int,X1 : $int] : ($less(X0,X1) => fib_sorted(mycons(X0,mycons(X1,nil))))),
% 3.53/1.14 file('/export/starexec/sandbox/benchmark/theBenchmark.p',double_is_fib_sorted_if_ordered)).
% 3.53/1.14
% 3.53/1.14 tff(f4,axiom,(
% 3.53/1.14 ! [X0 : $int,X1 : $int,X2 : $int,X3 : list] : ((fib_sorted(mycons(X1,mycons(X2,X3))) & $greatereq(X2,$sum(X0,X1)) & $less(X0,X1)) => fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3)))))),
% 3.53/1.14 file('/export/starexec/sandbox/benchmark/theBenchmark.p',recursive_fib_sort)).
% 3.53/1.14
% 3.53/1.14 tff(f5,conjecture,(
% 3.53/1.14 fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 3.53/1.14 file('/export/starexec/sandbox/benchmark/theBenchmark.p',check_list)).
% 3.53/1.14
% 3.53/1.14 tff(f6,negated_conjecture,(
% 3.53/1.14 ~fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 3.53/1.14 inference(negated_conjecture,[],[f5])).
% 3.53/1.14
% 3.53/1.14 tff(f7,plain,(
% 3.53/1.14 ! [X0 : $int,X1 : $int,X2 : $int,X3 : list] : ((fib_sorted(mycons(X1,mycons(X2,X3))) & ~$less(X2,$sum(X0,X1)) & $less(X0,X1)) => fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3)))))),
% 3.53/1.14 inference(theory_normalization,[],[f4])).
% 3.53/1.14
% 3.53/1.14 tff(f20,plain,(
% 3.53/1.14 ~fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 3.53/1.14 inference(flattening,[],[f6])).
% 3.53/1.14
% 3.53/1.14 tff(f21,plain,(
% 3.53/1.14 ! [X0 : $int,X1 : $int] : (fib_sorted(mycons(X0,mycons(X1,nil))) | ~$less(X0,X1))),
% 3.53/1.14 inference(ennf_transformation,[],[f3])).
% 3.53/1.14
% 3.53/1.14 tff(f22,plain,(
% 3.53/1.14 ! [X0 : $int,X1 : $int,X2 : $int,X3 : list] : (fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3)))) | (~fib_sorted(mycons(X1,mycons(X2,X3))) | $less(X2,$sum(X0,X1)) | ~$less(X0,X1)))),
% 3.53/1.14 inference(ennf_transformation,[],[f7])).
% 3.53/1.14
% 3.53/1.14 tff(f23,plain,(
% 3.53/1.14 ! [X0 : $int,X1 : $int,X2 : $int,X3 : list] : (fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3)))) | ~fib_sorted(mycons(X1,mycons(X2,X3))) | $less(X2,$sum(X0,X1)) | ~$less(X0,X1))),
% 3.53/1.14 inference(flattening,[],[f22])).
% 3.53/1.14
% 3.53/1.14 tff(f26,plain,(
% 3.53/1.14 ( ! [X0 : $int,X1 : $int] : (fib_sorted(mycons(X0,mycons(X1,nil))) | ~$less(X0,X1)) )),
% 3.53/1.14 inference(cnf_transformation,[],[f21])).
% 3.53/1.14
% 3.53/1.14 tff(f27,plain,(
% 3.53/1.14 ( ! [X2 : $int,X3 : list,X0 : $int,X1 : $int] : (fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3)))) | ~fib_sorted(mycons(X1,mycons(X2,X3))) | $less(X2,$sum(X0,X1)) | ~$less(X0,X1)) )),
% 3.53/1.14 inference(cnf_transformation,[],[f23])).
% 3.53/1.14
% 3.53/1.14 tff(f28,plain,(
% 3.53/1.14 ~fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 3.53/1.14 inference(cnf_transformation,[],[f20])).
% 3.53/1.14
% 3.53/1.14 cnf(c_63,plain,
% 3.53/1.14 (~$less_int(X0_3,X1_3)|fib_sorted(mycons(X0_3,mycons(X1_3,nil)))),
% 3.53/1.14 inference(cnf_transformation,[],[f26])).
% 3.53/1.14
% 3.53/1.14 cnf(c_64,plain,
% 3.53/1.14 (~fib_sorted(mycons(X0_3,mycons(X1_3,X0_13)))|~$less_int(X2_3,X0_3)|
% 3.53/1.14 fib_sorted(mycons(X2_3,mycons(X0_3,mycons(X1_3,X0_13))))|$less_int(X1_3,$sum_int(X2_3,X0_3))),
% 3.53/1.14 inference(cnf_transformation,[],[f27])).
% 3.53/1.14
% 3.53/1.14 cnf(c_65,negated_conjecture,
% 3.53/1.14 (~fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 3.53/1.14 inference(cnf_transformation,[],[f28])).
% 3.53/1.14
% 3.53/1.14 cnf(c_67,plain,($less_int(1,2)),theory(arith)).
% 3.53/1.14
% 3.53/1.14 cnf(c_68,plain,($less_int(2,4)),theory(arith)).
% 3.53/1.14
% 3.53/1.14 cnf(c_69,plain,($less_int(4,7)),theory(arith)).
% 3.53/1.14
% 3.53/1.14 cnf(c_70,plain,($less_int(7,100)),theory(arith)).
% 3.53/1.14
% 3.53/1.14 cnf(c_948,plain,
% 3.53/1.14 (~$less_int(7,100)|fib_sorted(mycons(7,mycons(100,nil)))),
% 3.53/1.14 inference(instantiation,[status(thm)],[c_63])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1080,plain,
% 3.53/1.14 (~fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))|~$less_int(1,2)|
% 3.53/1.14 $less_int(4,$sum_int(1,2))),
% 3.53/1.14 inference(superposition,[status(thm)],[c_64,c_65])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1081,plain,
% 3.53/1.14 (~fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))|$less_int(4,$sum_int(1,2))),
% 3.53/1.14 inference(forward_subsumption_resolution,[status(thm)],[c_1080,c_67])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1198,plain,
% 3.53/1.14 (~fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
% 3.53/1.14 inference(smt_theory_normalisation,[status(thm)],[c_1081])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1199,plain,
% 3.53/1.14 (~fib_sorted(mycons(4,mycons(7,mycons(100,nil))))|~$less_int(2,4)|
% 3.53/1.14 $less_int(7,$sum_int(2,4))),
% 3.53/1.14 inference(superposition,[status(thm)],[c_64,c_1198])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1200,plain,
% 3.53/1.14 (~fib_sorted(mycons(4,mycons(7,mycons(100,nil))))|$less_int(7,$sum_int(2,4))),
% 3.53/1.14 inference(forward_subsumption_resolution,[status(thm)],[c_1199,c_68])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1203,plain,
% 3.53/1.14 (~fib_sorted(mycons(4,mycons(7,mycons(100,nil))))),
% 3.53/1.14 inference(smt_theory_normalisation,[status(thm)],[c_1200])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1204,plain,
% 3.53/1.14 (~fib_sorted(mycons(7,mycons(100,nil)))|~$less_int(4,7)|$less_int(100,$sum_int(4,7))),
% 3.53/1.14 inference(superposition,[status(thm)],[c_64,c_1203])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1205,plain,
% 3.53/1.14 (~fib_sorted(mycons(7,mycons(100,nil)))|$less_int(100,$sum_int(4,7))),
% 3.53/1.14 inference(forward_subsumption_resolution,[status(thm)],[c_1204,c_69])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1212,plain,
% 3.53/1.14 (~fib_sorted(mycons(7,mycons(100,nil)))),
% 3.53/1.14 inference(smt_theory_normalisation,[status(thm)],[c_1205])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1213,plain,
% 3.53/1.14 ($false),
% 3.53/1.14 inference(prop_impl_just,[status(thm)],[c_1212,c_948,c_70])).
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 % SZS output end CNFRefutation for theBenchmark.p
% 3.53/1.14
% 3.53/1.14
%------------------------------------------------------------------------------