0.04/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.15 % Command : python3 prover_driver.py --schedule_mode external --schedule fof_schedule --no_cores 8 --problem_version fof /export/starexec/sandbox/benchmark/theBenchmark.p 120 --prover /export/starexec/sandbox/solver/bin/res/iproveropt_no_z3 0.15/0.36 % Computer : n022.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.37 % CPULimit : 960 0.15/0.37 % WCLimit : 120 0.15/0.37 % DateTime : Tue Aug 9 01:57:46 EDT 2022 0.15/0.37 % CPUTime : 2.89/1.52 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p 2.89/1.52 2.89/1.52 %---------------- iProver v3.6 (pre CASC-J11 2022) ----------------% 2.89/1.52 2.89/1.52 ------ iProver source info 2.89/1.52 2.89/1.52 git: date: 2022-07-26 19:47:37 +0300 2.89/1.52 git: sha1: 69e283425f6c8ae3fb9e67f2058d741e849b12e1 2.89/1.52 git: non_committed_changes: false 2.89/1.52 git: last_make_outside_of_git: false 2.89/1.52 2.89/1.52 ------ Parsing... 2.89/1.52 ------ Clausification by vclausify_rel & Parsing by iProver... 2.89/1.52 2.89/1.52 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e 2.89/1.52 2.89/1.52 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 2.89/1.52 2.89/1.52 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 2.89/1.52 ------ Proving... 2.89/1.52 ------ Problem Properties 2.89/1.52 2.89/1.52 2.89/1.52 clauses 186 2.89/1.52 conjectures 53 2.89/1.52 EPR 55 2.89/1.52 Horn 118 2.89/1.52 unary 22 2.89/1.52 binary 40 2.89/1.52 lits 624 2.89/1.52 lits eq 80 2.89/1.52 fd_pure 0 2.89/1.52 fd_pseudo 0 2.89/1.52 fd_cond 21 2.89/1.52 fd_pseudo_cond 14 2.89/1.52 AC symbols 0 2.89/1.52 2.89/1.52 ------ Schedule dynamic 5 is on 2.89/1.52 2.89/1.52 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 2.89/1.52 2.89/1.52 2.89/1.52 ------ 2.89/1.52 Current options: 2.89/1.52 ------ 2.89/1.52 2.89/1.52 2.89/1.52 2.89/1.52 2.89/1.52 ------ Proving... 2.89/1.52 2.89/1.52 2.89/1.52 % SZS status Theorem for theBenchmark.p 2.89/1.52 2.89/1.52 % SZS output start CNFRefutation for theBenchmark.p 2.89/1.52 2.89/1.52 fof(f555,plain,( 2.89/1.52 nil = sK55 | segmentP(sK56,sK57)), 2.89/1.52 inference(cnf_transformation,[],[f348])). 2.89/1.52 2.89/1.52 fof(f563,plain,( 2.89/1.52 nil = sK54), 2.89/1.52 inference(cnf_transformation,[],[f348])). 2.89/1.52 2.89/1.52 fof(f96,conjecture,( 2.89/1.52 ! [X0] : (ssList(X0) => ! [X1] : (ssList(X1) => ! [X2] : (ssList(X2) => ! [X3] : (ssList(X3) => (nil != X1 | X1 != X3 | X0 != X2 | nil = X0 | ((nil != X3 | nil != X2) & ! [X4] : (ssList(X4) => (~segmentP(X3,X4) | ~segmentP(X2,X4) | ~neq(X4,nil)))))))))), 2.89/1.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)). 2.89/1.52 2.89/1.52 fof(f97,negated_conjecture,( 2.89/1.52 ~! [X0] : (ssList(X0) => ! [X1] : (ssList(X1) => ! [X2] : (ssList(X2) => ! [X3] : (ssList(X3) => (nil != X1 | X1 != X3 | X0 != X2 | nil = X0 | ((nil != X3 | nil != X2) & ! [X4] : (ssList(X4) => (~segmentP(X3,X4) | ~segmentP(X2,X4) | ~neq(X4,nil)))))))))), 2.89/1.52 inference(negated_conjecture,[],[f96])). 2.89/1.52 2.89/1.52 fof(f221,plain,( 2.89/1.52 ? [X0] : (? [X1] : (? [X2] : (? [X3] : ((nil = X1 & X1 = X3 & X0 = X2 & nil != X0 & ((nil = X3 & nil = X2) | ? [X4] : ((segmentP(X3,X4) & segmentP(X2,X4) & neq(X4,nil)) & ssList(X4)))) & ssList(X3)) & ssList(X2)) & ssList(X1)) & ssList(X0))), 2.89/1.52 inference(ennf_transformation,[],[f97])). 2.89/1.52 2.89/1.52 fof(f222,plain,( 2.89/1.52 ? [X0] : (? [X1] : (? [X2] : (? [X3] : (nil = X1 & X1 = X3 & X0 = X2 & nil != X0 & ((nil = X3 & nil = X2) | ? [X4] : (segmentP(X3,X4) & segmentP(X2,X4) & neq(X4,nil) & ssList(X4))) & ssList(X3)) & ssList(X2)) & ssList(X1)) & ssList(X0))), 2.89/1.52 inference(flattening,[],[f221])). 2.89/1.52 2.89/1.52 fof(f347,plain,( 2.89/1.52 ? [X4] : (segmentP(sK56,X4) & segmentP(sK55,X4) & neq(X4,nil) & ssList(X4)) => (segmentP(sK56,sK57) & segmentP(sK55,sK57) & neq(sK57,nil) & ssList(sK57))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f346,plain,( 2.89/1.52 ? [X3] : (nil = sK54 & sK54 = X3 & sK53 = sK55 & nil != sK53 & ((nil = X3 & nil = sK55) | ? [X4] : (segmentP(X3,X4) & segmentP(sK55,X4) & neq(X4,nil) & ssList(X4))) & ssList(X3)) => (nil = sK54 & sK54 = sK56 & sK53 = sK55 & nil != sK53 & ((nil = sK56 & nil = sK55) | ? [X4] : (segmentP(sK56,X4) & segmentP(sK55,X4) & neq(X4,nil) & ssList(X4))) & ssList(sK56))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f345,plain,( 2.89/1.52 ? [X2] : (? [X3] : (nil = sK54 & sK54 = X3 & sK53 = X2 & nil != sK53 & ((nil = X3 & nil = X2) | ? [X4] : (segmentP(X3,X4) & segmentP(X2,X4) & neq(X4,nil) & ssList(X4))) & ssList(X3)) & ssList(X2)) => (? [X3] : (nil = sK54 & sK54 = X3 & sK53 = sK55 & nil != sK53 & ((nil = X3 & nil = sK55) | ? [X4] : (segmentP(X3,X4) & segmentP(sK55,X4) & neq(X4,nil) & ssList(X4))) & ssList(X3)) & ssList(sK55))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f344,plain,( 2.89/1.52 ? [X1] : (? [X2] : (? [X3] : (nil = X1 & X1 = X3 & sK53 = X2 & nil != sK53 & ((nil = X3 & nil = X2) | ? [X4] : (segmentP(X3,X4) & segmentP(X2,X4) & neq(X4,nil) & ssList(X4))) & ssList(X3)) & ssList(X2)) & ssList(X1)) => (? [X2] : (? [X3] : (nil = sK54 & sK54 = X3 & sK53 = X2 & nil != sK53 & ((nil = X3 & nil = X2) | ? [X4] : (segmentP(X3,X4) & segmentP(X2,X4) & neq(X4,nil) & ssList(X4))) & ssList(X3)) & ssList(X2)) & ssList(sK54))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f343,plain,( 2.89/1.52 ? [X0] : (? [X1] : (? [X2] : (? [X3] : (nil = X1 & X1 = X3 & X0 = X2 & nil != X0 & ((nil = X3 & nil = X2) | ? [X4] : (segmentP(X3,X4) & segmentP(X2,X4) & neq(X4,nil) & ssList(X4))) & ssList(X3)) & ssList(X2)) & ssList(X1)) & ssList(X0)) => (? [X1] : (? [X2] : (? [X3] : (nil = X1 & X1 = X3 & sK53 = X2 & nil != sK53 & ((nil = X3 & nil = X2) | ? [X4] : (segmentP(X3,X4) & segmentP(X2,X4) & neq(X4,nil) & ssList(X4))) & ssList(X3)) & ssList(X2)) & ssList(X1)) & ssList(sK53))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f348,plain,( 2.89/1.52 (((nil = sK54 & sK54 = sK56 & sK53 = sK55 & nil != sK53 & ((nil = sK56 & nil = sK55) | (segmentP(sK56,sK57) & segmentP(sK55,sK57) & neq(sK57,nil) & ssList(sK57))) & ssList(sK56)) & ssList(sK55)) & ssList(sK54)) & ssList(sK53)), 2.89/1.52 inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f222,f347,f346,f345,f344,f343])). 2.89/1.52 2.89/1.52 fof(f562,plain,( 2.89/1.52 sK54 = sK56), 2.89/1.52 inference(cnf_transformation,[],[f348])). 2.89/1.52 2.89/1.52 fof(f564,plain,( 2.89/1.52 nil = sK56), 2.89/1.52 inference(definition_unfolding,[],[f563,f562])). 2.89/1.52 2.89/1.52 fof(f628,plain,( 2.89/1.52 sK55 = sK56 | segmentP(sK56,sK57)), 2.89/1.52 inference(definition_unfolding,[],[f555,f564])). 2.89/1.52 2.89/1.52 fof(f560,plain,( 2.89/1.52 nil != sK53), 2.89/1.52 inference(cnf_transformation,[],[f348])). 2.89/1.52 2.89/1.52 fof(f561,plain,( 2.89/1.52 sK53 = sK55), 2.89/1.52 inference(cnf_transformation,[],[f348])). 2.89/1.52 2.89/1.52 fof(f623,plain,( 2.89/1.52 sK55 != sK56), 2.89/1.52 inference(definition_unfolding,[],[f560,f564,f561])). 2.89/1.52 2.89/1.52 fof(f64,axiom,( 2.89/1.52 ! [X0] : (ssList(X0) => (segmentP(nil,X0) <=> nil = X0))), 2.89/1.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58)). 2.89/1.52 2.89/1.52 fof(f184,plain,( 2.89/1.52 ! [X0] : ((segmentP(nil,X0) <=> nil = X0) | ~ssList(X0))), 2.89/1.52 inference(ennf_transformation,[],[f64])). 2.89/1.52 2.89/1.52 fof(f310,plain,( 2.89/1.52 ! [X0] : (((segmentP(nil,X0) | nil != X0) & (nil = X0 | ~segmentP(nil,X0))) | ~ssList(X0))), 2.89/1.52 inference(nnf_transformation,[],[f184])). 2.89/1.52 2.89/1.52 fof(f488,plain,( 2.89/1.52 ( ! [X0] : (nil = X0 | ~segmentP(nil,X0) | ~ssList(X0)) )), 2.89/1.52 inference(cnf_transformation,[],[f310])). 2.89/1.52 2.89/1.52 fof(f607,plain,( 2.89/1.52 ( ! [X0] : (sK56 = X0 | ~segmentP(sK56,X0) | ~ssList(X0)) )), 2.89/1.52 inference(definition_unfolding,[],[f488,f564,f564])). 2.89/1.52 2.89/1.52 fof(f553,plain,( 2.89/1.52 nil = sK55 | neq(sK57,nil)), 2.89/1.52 inference(cnf_transformation,[],[f348])). 2.89/1.52 2.89/1.52 fof(f630,plain,( 2.89/1.52 sK55 = sK56 | neq(sK57,sK56)), 2.89/1.52 inference(definition_unfolding,[],[f553,f564,f564])). 2.89/1.52 2.89/1.52 fof(f549,plain,( 2.89/1.52 ssList(sK54)), 2.89/1.52 inference(cnf_transformation,[],[f348])). 2.89/1.52 2.89/1.52 fof(f632,plain,( 2.89/1.52 ssList(sK56)), 2.89/1.52 inference(definition_unfolding,[],[f549,f562])). 2.89/1.52 2.89/1.52 fof(f552,plain,( 2.89/1.52 nil = sK55 | ssList(sK57)), 2.89/1.52 inference(cnf_transformation,[],[f348])). 2.89/1.52 2.89/1.52 fof(f631,plain,( 2.89/1.52 sK55 = sK56 | ssList(sK57)), 2.89/1.52 inference(definition_unfolding,[],[f552,f564])). 2.89/1.52 2.89/1.52 cnf(c_247,negated_conjecture, 2.89/1.52 ( sK56 = sK55 | segmentP(sK56,sK57) ), 2.89/1.52 inference(cnf_transformation,[],[f628]) ). 2.89/1.52 2.89/1.52 cnf(c_246,negated_conjecture, 2.89/1.52 ( sK56 != sK55 ), 2.89/1.52 inference(cnf_transformation,[],[f623]) ). 2.89/1.52 2.89/1.52 cnf(c_378,negated_conjecture, 2.89/1.52 ( segmentP(sK56,sK57) ), 2.89/1.52 inference(global_propositional_subsumption,[status(thm)],[c_247,c_246]) ). 2.89/1.52 2.89/1.52 cnf(c_187,negated_conjecture, 2.89/1.52 ( ~ segmentP(sK56,X0) | ~ ssList(X0) | X0 = sK56 ), 2.89/1.52 inference(cnf_transformation,[],[f607]) ). 2.89/1.52 2.89/1.52 cnf(c_11855,plain, 2.89/1.52 ( ~ ssList(sK57) | sK56 = sK57 ), 2.89/1.52 inference(superposition,[status(thm)],[c_378,c_187]) ). 2.89/1.52 2.89/1.52 cnf(c_127,plain, 2.89/1.52 ( ~ neq(X0,X0) | ~ ssList(X0) ), 2.89/1.52 inference(cnf_transformation,[],[f663]) ). 2.89/1.52 2.89/1.52 cnf(c_249,negated_conjecture, 2.89/1.52 ( sK56 = sK55 | neq(sK57,sK56) ), 2.89/1.52 inference(cnf_transformation,[],[f630]) ). 2.89/1.52 2.89/1.52 cnf(c_374,negated_conjecture, 2.89/1.52 ( neq(sK57,sK56) ), 2.89/1.52 inference(global_propositional_subsumption,[status(thm)],[c_249,c_246]) ). 2.89/1.52 2.89/1.52 cnf(c_3227,plain, 2.89/1.52 ( X0 != sK56 | X0 != sK57 | ~ ssList(X0) ), 2.89/1.52 inference(resolution_lifted,[status(thm)],[c_127,c_374]) ). 2.89/1.52 2.89/1.52 cnf(c_3228,plain, 2.89/1.52 ( sK56 != sK57 | ~ ssList(sK56) ), 2.89/1.52 inference(unflattening,[status(thm)],[c_3227]) ). 2.89/1.52 2.89/1.52 cnf(c_253,negated_conjecture, 2.89/1.52 ( ssList(sK56) ), 2.89/1.52 inference(cnf_transformation,[],[f632]) ). 2.89/1.52 2.89/1.52 cnf(c_3229,plain, 2.89/1.52 ( sK56 != sK57 ), 2.89/1.52 inference(global_propositional_subsumption,[status(thm)],[c_3228,c_253]) ). 2.89/1.52 2.89/1.52 cnf(c_250,negated_conjecture, 2.89/1.52 ( sK56 = sK55 | ssList(sK57) ), 2.89/1.52 inference(cnf_transformation,[],[f631]) ). 2.89/1.52 2.89/1.52 cnf(c_372,negated_conjecture, 2.89/1.52 ( ssList(sK57) ), 2.89/1.52 inference(global_propositional_subsumption,[status(thm)],[c_250,c_246]) ). 2.89/1.52 2.89/1.52 cnf(c_11856,plain, 2.89/1.52 ( $false ), 2.89/1.52 inference(forward_subsumption_resolution, 2.89/1.52 [status(thm)], 2.89/1.52 [c_11855,c_3229,c_372]) ). 2.89/1.52 2.89/1.52 2.89/1.52 % SZS output end CNFRefutation for theBenchmark.p 2.89/1.52 2.89/1.52 ------ Statistics 2.89/1.52 2.89/1.52 ------ Selected 2.89/1.52 2.89/1.52 total_time: 0.264 2.89/1.52 2.90/1.55 EOF