%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL090-1 : TPTP v8.1.0. Released v2.7.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n029.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 : 600s % DateTime : Fri Jul 15 00:24:50 EDT 2022 % Result : Unsatisfiable 0.18s 0.39s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : COL090-1 : TPTP v8.1.0. Released v2.7.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n029.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue May 31 08:55:14 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 31 Number of unprocessed: 31 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 31 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 8 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 23 extension rule candidate clauses % 0.12/0.37 # 8 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.39 # There were 4 total branch saturation attempts. % 0.18/0.39 # There were 0 of these attempts blocked. % 0.18/0.39 # There were 0 deferred branch saturation attempts. % 0.18/0.39 # There were 0 free duplicated saturations. % 0.18/0.39 # There were 4 total successful branch saturations. % 0.18/0.39 # There were 0 successful branch saturations in interreduction. % 0.18/0.39 # There were 0 successful branch saturations on the branch. % 0.18/0.39 # There were 4 successful branch saturations after the branch. % 0.18/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.39 # Begin clausification derivation % 0.18/0.39 % 0.18/0.39 # End clausification derivation % 0.18/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.39 cnf(i_0_64, negated_conjecture, (member(pair(comb_app(comb_app(combS,combK),combK),r),contract))). % 0.18/0.39 cnf(i_0_41, plain, (member(combK,comb))). % 0.18/0.39 cnf(i_0_42, plain, (member(combS,comb))). % 0.18/0.39 cnf(i_0_33, plain, (combS!=combK)). % 0.18/0.39 cnf(i_0_62, plain, (~member(pair(combK,X1),contract))). % 0.18/0.39 cnf(i_0_63, plain, (~member(pair(combS,X1),contract))). % 0.18/0.39 cnf(i_0_34, plain, (comb_app(X1,X2)!=combK)). % 0.18/0.39 cnf(i_0_35, plain, (comb_app(X1,X2)!=combS)). % 0.18/0.39 cnf(i_0_40, plain, (member(X1,comb)|~member(comb_app(X2,X1),comb))). % 0.18/0.39 cnf(i_0_48, plain, (member(X1,comb)|~ap_contractE_c1(X2,X3,X1))). % 0.18/0.39 cnf(i_0_49, plain, (member(X1,comb)|~ap_contractE_c1(X2,X1,X3))). % 0.18/0.39 cnf(i_0_39, plain, (member(X1,comb)|~member(comb_app(X1,X2),comb))). % 0.18/0.39 cnf(i_0_37, plain, (X1=X2|comb_app(X3,X1)!=comb_app(X4,X2))). % 0.18/0.39 cnf(i_0_36, plain, (X1=X2|comb_app(X1,X3)!=comb_app(X2,X4))). % 0.18/0.39 cnf(i_0_53, plain, (member(X1,comb)|~ap_contractE_c2(X2,X1,X3))). % 0.18/0.39 cnf(i_0_57, plain, (member(X1,comb)|~ap_contractE_c3(X2,X1,X3))). % 0.18/0.39 cnf(i_0_44, plain, (member(pair(X1,X1),rtrancl(contract))|~member(X1,comb))). % 0.18/0.39 cnf(i_0_60, plain, (member(X1,comb)|~ap_contractE_c4(X1,X2,X3))). % 0.18/0.39 cnf(i_0_50, plain, (X1=comb_app(combK,X2)|~ap_contractE_c1(X1,X3,X2))). % 0.18/0.39 cnf(i_0_51, plain, (member(ap_contractE_sk1p(X1,X2,X3),comb)|~ap_contractE_c2(X1,X2,X3))). % 0.18/0.39 cnf(i_0_52, plain, (member(ap_contractE_sk1q(X1,X2,X3),comb)|~ap_contractE_c2(X1,X2,X3))). % 0.18/0.39 cnf(i_0_43, plain, (member(comb_app(X1,X2),comb)|~member(X2,comb)|~member(X1,comb))). % 0.18/0.39 cnf(i_0_61, plain, (comb_app(X1,ap_contractE_sk3q(X1,X2,X3))=X3|~ap_contractE_c4(X1,X2,X3))). % 0.18/0.39 cnf(i_0_45, plain, (member(pair(comb_app(comb_app(combK,X1),X2),X1),contract)|~member(X2,comb)|~member(X1,comb))). % 0.18/0.39 cnf(i_0_59, plain, (member(pair(X1,ap_contractE_sk3q(X2,X1,X3)),contract)|~ap_contractE_c4(X2,X1,X3))). % 0.18/0.39 cnf(i_0_56, plain, (member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)|~ap_contractE_c3(X1,X2,X3))). % 0.18/0.39 cnf(i_0_58, plain, (comb_app(ap_contractE_sk2q(X1,X2,X3),X2)=X3|~ap_contractE_c3(X1,X2,X3))). % 0.18/0.39 cnf(i_0_47, plain, (ap_contractE_c4(X1,X2,X3)|ap_contractE_c3(X1,X2,X3)|ap_contractE_c2(X1,X2,X3)|ap_contractE_c1(X1,X2,X3)|~member(pair(comb_app(X1,X2),X3),contract))). % 0.18/0.39 cnf(i_0_55, plain, (comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))=X1|~ap_contractE_c2(X1,X2,X3))). % 0.18/0.39 cnf(i_0_54, plain, (comb_app(comb_app(ap_contractE_sk1p(X1,X2,X3),X2),comb_app(ap_contractE_sk1q(X1,X2,X3),X2))=X3|~ap_contractE_c2(X1,X2,X3))). % 0.18/0.39 cnf(i_0_46, plain, (member(pair(comb_app(comb_app(comb_app(combS,X1),X2),X3),comb_app(comb_app(X1,X3),comb_app(X2,X3))),contract)|~member(X3,comb)|~member(X2,comb)|~member(X1,comb))). % 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.39 # Begin printing tableau % 0.18/0.39 # Found 7 steps % 0.18/0.39 cnf(i_0_64, negated_conjecture, (member(pair(comb_app(comb_app(combS,combK),combK),r),contract)), inference(start_rule)). % 0.18/0.39 cnf(i_0_65, plain, (member(pair(comb_app(comb_app(combS,combK),combK),r),contract)), inference(extension_rule, [i_0_47])). % 0.18/0.39 cnf(i_0_106, plain, (ap_contractE_c4(comb_app(combS,combK),combK,r)), inference(extension_rule, [i_0_60])). % 0.18/0.39 cnf(i_0_107, plain, (ap_contractE_c3(comb_app(combS,combK),combK,r)), inference(etableau_closure_rule, [i_0_107, ...])). % 0.18/0.39 cnf(i_0_108, plain, (ap_contractE_c2(comb_app(combS,combK),combK,r)), inference(etableau_closure_rule, [i_0_108, ...])). % 0.18/0.39 cnf(i_0_109, plain, (ap_contractE_c1(comb_app(combS,combK),combK,r)), inference(etableau_closure_rule, [i_0_109, ...])). % 0.18/0.39 cnf(i_0_137, plain, (member(comb_app(combS,combK),comb)), inference(etableau_closure_rule, [i_0_137, ...])). % 0.18/0.39 # End printing tableau % 0.18/0.39 # SZS output end % 0.18/0.39 # Branches closed with saturation will be marked with an "s" % 0.18/0.39 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.18/0.39 # We now have 1 tableaux to operate on % 0.18/0.39 # Found closed tableau during pool population. % 0.18/0.39 # Proof search is over... % 0.18/0.39 # Freeing feature tree %------------------------------------------------------------------------------