TSTP Solution File: DAT001_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT001_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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 : Wed Aug 30 22:15:18 EDT 2023
% Result : Theorem 2.23s 1.07s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT001_1 : TPTP v8.1.2. Released v5.0.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n011.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu Aug 24 14:17:37 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.15/0.42 Running TFA theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.23/1.07 % SZS status Started for theBenchmark.p
% 2.23/1.07 % SZS status Theorem for theBenchmark.p
% 2.23/1.07
% 2.23/1.07 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.23/1.07
% 2.23/1.07 ------ iProver source info
% 2.23/1.07
% 2.23/1.07 git: date: 2023-05-31 18:12:56 +0000
% 2.23/1.07 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.23/1.07 git: non_committed_changes: false
% 2.23/1.07 git: last_make_outside_of_git: false
% 2.23/1.07
% 2.23/1.07 ------ Parsing...
% 2.23/1.07 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.23/1.07
% 2.23/1.07 ------ 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
% 2.23/1.07
% 2.23/1.07 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.23/1.07
% 2.23/1.07 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.23/1.07 ------ Proving...
% 2.23/1.07 ------ Problem Properties
% 2.23/1.07
% 2.23/1.07
% 2.23/1.07 clauses 20
% 2.23/1.07 conjectures 1
% 2.23/1.07 EPR 9
% 2.23/1.07 Horn 18
% 2.23/1.07 unary 15
% 2.23/1.07 binary 2
% 2.23/1.07 lits 28
% 2.23/1.07 lits eq 7
% 2.23/1.07 fd_pure 0
% 2.23/1.07 fd_pseudo 0
% 2.23/1.07 fd_cond 0
% 2.23/1.07 fd_pseudo_cond 1
% 2.23/1.07 AC symbols 1
% 2.23/1.07
% 2.23/1.07 ------ Input Options Time Limit: Unbounded
% 2.23/1.07
% 2.23/1.07
% 2.23/1.07 ------
% 2.23/1.07 Current options:
% 2.23/1.07 ------
% 2.23/1.07
% 2.23/1.07
% 2.23/1.07
% 2.23/1.07
% 2.23/1.07 ------ Proving...
% 2.23/1.07
% 2.23/1.07
% 2.23/1.07 % SZS status Theorem for theBenchmark.p
% 2.23/1.07
% 2.23/1.07 % SZS output start CNFRefutation for theBenchmark.p
% 2.23/1.07
% 2.23/1.07 tff(f2,axiom,(
% 2.23/1.07 ! [X0 : $int] : sorted(mycons(X0,nil))),
% 2.23/1.07 file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_is_sorted)).
% 2.23/1.07
% 2.23/1.07 tff(f3,axiom,(
% 2.23/1.07 ! [X0 : $int,X1 : $int,X2 : list] : ((sorted(mycons(X1,X2)) & $less(X0,X1)) => sorted(mycons(X0,mycons(X1,X2))))),
% 2.23/1.07 file('/export/starexec/sandbox/benchmark/theBenchmark.p',recursive_sort)).
% 2.23/1.07
% 2.23/1.07 tff(f4,conjecture,(
% 2.23/1.07 sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 2.23/1.07 file('/export/starexec/sandbox/benchmark/theBenchmark.p',check_list)).
% 2.23/1.07
% 2.23/1.07 tff(f5,negated_conjecture,(
% 2.23/1.07 ~sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 2.23/1.07 inference(negated_conjecture,[],[f4])).
% 2.23/1.07
% 2.23/1.07 tff(f18,plain,(
% 2.23/1.07 ~sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 2.23/1.07 inference(flattening,[],[f5])).
% 2.23/1.07
% 2.23/1.07 tff(f19,plain,(
% 2.23/1.07 ! [X0 : $int,X1 : $int,X2 : list] : (sorted(mycons(X0,mycons(X1,X2))) | (~sorted(mycons(X1,X2)) | ~$less(X0,X1)))),
% 2.23/1.07 inference(ennf_transformation,[],[f3])).
% 2.23/1.07
% 2.23/1.07 tff(f20,plain,(
% 2.23/1.07 ! [X0 : $int,X1 : $int,X2 : list] : (sorted(mycons(X0,mycons(X1,X2))) | ~sorted(mycons(X1,X2)) | ~$less(X0,X1))),
% 2.23/1.07 inference(flattening,[],[f19])).
% 2.23/1.07
% 2.23/1.07 tff(f22,plain,(
% 2.23/1.07 ( ! [X0 : $int] : (sorted(mycons(X0,nil))) )),
% 2.23/1.07 inference(cnf_transformation,[],[f2])).
% 2.23/1.07
% 2.23/1.07 tff(f23,plain,(
% 2.23/1.07 ( ! [X2 : list,X0 : $int,X1 : $int] : (sorted(mycons(X0,mycons(X1,X2))) | ~sorted(mycons(X1,X2)) | ~$less(X0,X1)) )),
% 2.23/1.07 inference(cnf_transformation,[],[f20])).
% 2.23/1.07
% 2.23/1.07 tff(f24,plain,(
% 2.23/1.07 ~sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 2.23/1.07 inference(cnf_transformation,[],[f18])).
% 2.23/1.07
% 2.23/1.07 cnf(c_62,plain,
% 2.23/1.07 (sorted(mycons(X0_3,nil))),
% 2.23/1.07 inference(cnf_transformation,[],[f22])).
% 2.23/1.07
% 2.23/1.07 cnf(c_63,plain,
% 2.23/1.07 (~sorted(mycons(X0_3,X0_13))|~$less_int(X1_3,X0_3)|sorted(mycons(X1_3,mycons(X0_3,X0_13)))),
% 2.23/1.07 inference(cnf_transformation,[],[f23])).
% 2.23/1.07
% 2.23/1.07 cnf(c_64,negated_conjecture,
% 2.23/1.07 (~sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))),
% 2.23/1.07 inference(cnf_transformation,[],[f24])).
% 2.23/1.07
% 2.23/1.07 cnf(c_66,plain,($less_int(1,2)),theory(arith)).
% 2.23/1.07
% 2.23/1.07 cnf(c_67,plain,($less_int(2,4)),theory(arith)).
% 2.23/1.07
% 2.23/1.07 cnf(c_68,plain,($less_int(4,7)),theory(arith)).
% 2.23/1.07
% 2.23/1.07 cnf(c_69,plain,($less_int(7,100)),theory(arith)).
% 2.23/1.07
% 2.23/1.07 cnf(c_893,plain,
% 2.23/1.07 (~sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))|~$less_int(1,2)),
% 2.23/1.07 inference(superposition,[status(thm)],[c_63,c_64])).
% 2.23/1.07
% 2.23/1.07 cnf(c_894,plain,
% 2.23/1.07 (~sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
% 2.23/1.07 inference(forward_subsumption_resolution,[status(thm)],[c_893,c_66])).
% 2.23/1.07
% 2.23/1.07 cnf(c_926,plain,
% 2.23/1.07 (~sorted(mycons(4,mycons(7,mycons(100,nil))))|~$less_int(2,4)),
% 2.23/1.07 inference(superposition,[status(thm)],[c_63,c_894])).
% 2.23/1.07
% 2.23/1.07 cnf(c_927,plain,
% 2.23/1.07 (~sorted(mycons(4,mycons(7,mycons(100,nil))))),
% 2.23/1.07 inference(forward_subsumption_resolution,[status(thm)],[c_926,c_67])).
% 2.23/1.07
% 2.23/1.07 cnf(c_928,plain,
% 2.23/1.07 (~sorted(mycons(7,mycons(100,nil)))|~$less_int(4,7)),
% 2.23/1.07 inference(superposition,[status(thm)],[c_63,c_927])).
% 2.23/1.07
% 2.23/1.07 cnf(c_929,plain,
% 2.23/1.07 (~sorted(mycons(7,mycons(100,nil)))),
% 2.23/1.07 inference(forward_subsumption_resolution,[status(thm)],[c_928,c_68])).
% 2.23/1.07
% 2.23/1.07 cnf(c_940,plain,
% 2.23/1.07 (~sorted(mycons(100,nil))|~$less_int(7,100)),
% 2.23/1.07 inference(superposition,[status(thm)],[c_63,c_929])).
% 2.23/1.07
% 2.23/1.07 cnf(c_941,plain,
% 2.23/1.07 ($false),
% 2.23/1.07 inference(forward_subsumption_resolution,[status(thm)],[c_940,c_69,c_62])).
% 2.23/1.07
% 2.23/1.07
% 2.23/1.07 % SZS output end CNFRefutation for theBenchmark.p
% 2.23/1.07
% 2.23/1.07
%------------------------------------------------------------------------------