%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL088-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 : n021.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 16.31s 16.61s % Output : CNFRefutation 16.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : COL088-1 : TPTP v8.1.0. Released v2.7.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n021.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 : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue May 31 13:33:44 EDT 2022 % 0.14/0.34 % CPUTime : % 0.21/0.37 # No SInE strategy applied % 0.21/0.37 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.37 # % 0.21/0.37 # Presaturation interreduction done % 0.21/0.37 # Number of axioms: 43 Number of unprocessed: 43 % 0.21/0.37 # Tableaux proof search. % 0.21/0.37 # APR header successfully linked. % 0.21/0.37 # Hello from C++ % 2.94/3.14 # The folding up rule is enabled... % 2.94/3.14 # Local unification is enabled... % 2.94/3.14 # Any saturation attempts will use folding labels... % 2.94/3.14 # 43 beginning clauses after preprocessing and clausification % 2.94/3.14 # Creating start rules for all 1 conjectures. % 2.94/3.14 # There are 1 start rule candidates: % 2.94/3.14 # Found 14 unit axioms. % 2.94/3.14 # 1 start rule tableaux created. % 2.94/3.14 # 29 extension rule candidate clauses % 2.94/3.14 # 14 unit axiom clauses % 2.94/3.14 % 2.94/3.14 # Requested 8, 32 cores available to the main process. % 2.94/3.14 # There are not enough tableaux to fork, creating more from the initial 1 % 16.27/16.44 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 16.27/16.44 # We now have 9 tableaux to operate on % 16.31/16.61 # There were 8 total branch saturation attempts. % 16.31/16.61 # There were 1 of these attempts blocked. % 16.31/16.61 # There were 0 deferred branch saturation attempts. % 16.31/16.61 # There were 0 free duplicated saturations. % 16.31/16.61 # There were 2 total successful branch saturations. % 16.31/16.61 # There were 0 successful branch saturations in interreduction. % 16.31/16.61 # There were 0 successful branch saturations on the branch. % 16.31/16.61 # There were 2 successful branch saturations after the branch. % 16.31/16.61 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.31/16.61 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.31/16.61 # Begin clausification derivation % 16.31/16.61 % 16.31/16.61 # End clausification derivation % 16.31/16.61 # Begin listing active clauses obtained from FOF to CNF conversion % 16.31/16.61 cnf(i_0_83, hypothesis, (member(r,comb))). % 16.31/16.61 cnf(i_0_84, hypothesis, (member(p,comb))). % 16.31/16.61 cnf(i_0_86, hypothesis, (member(pair(y,z),contract))). % 16.31/16.61 cnf(i_0_77, plain, (trans(rtrancl(X1)))). % 16.31/16.61 cnf(i_0_53, plain, (member(combK,comb))). % 16.31/16.61 cnf(i_0_54, plain, (member(combS,comb))). % 16.31/16.61 cnf(i_0_85, hypothesis, (member(pair(p,y),rtrancl(contract)))). % 16.31/16.61 cnf(i_0_87, hypothesis, (member(pair(comb_app(p,r),comb_app(y,r)),rtrancl(contract)))). % 16.31/16.61 cnf(i_0_45, plain, (combS!=combK)). % 16.31/16.61 cnf(i_0_88, negated_conjecture, (~member(pair(comb_app(p,r),comb_app(z,r)),rtrancl(contract)))). % 16.31/16.61 cnf(i_0_46, plain, (comb_app(X1,X2)!=combK)). % 16.31/16.61 cnf(i_0_47, plain, (comb_app(X1,X2)!=combS)). % 16.31/16.61 cnf(i_0_74, plain, (~member(pair(combK,X1),contract))). % 16.31/16.61 cnf(i_0_75, plain, (~member(pair(combS,X1),contract))). % 16.31/16.61 cnf(i_0_78, plain, (member(X1,comb)|~member(pair(X2,X1),contract))). % 16.31/16.61 cnf(i_0_56, plain, (member(pair(X1,X1),rtrancl(contract))|~member(X1,comb))). % 16.31/16.61 cnf(i_0_49, plain, (X1=X2|comb_app(X3,X1)!=comb_app(X4,X2))). % 16.31/16.61 cnf(i_0_52, plain, (member(X1,comb)|~member(comb_app(X2,X1),comb))). % 16.31/16.61 cnf(i_0_60, plain, (member(X1,comb)|~ap_contractE_c1(X2,X3,X1))). % 16.31/16.61 cnf(i_0_61, plain, (member(X1,comb)|~ap_contractE_c1(X2,X1,X3))). % 16.31/16.61 cnf(i_0_65, plain, (member(X1,comb)|~ap_contractE_c2(X2,X1,X3))). % 16.31/16.61 cnf(i_0_69, plain, (member(X1,comb)|~ap_contractE_c3(X2,X1,X3))). % 16.31/16.61 cnf(i_0_51, plain, (member(X1,comb)|~member(comb_app(X1,X2),comb))). % 16.31/16.61 cnf(i_0_48, plain, (X1=X2|comb_app(X1,X3)!=comb_app(X2,X4))). % 16.31/16.61 cnf(i_0_72, plain, (member(X1,comb)|~ap_contractE_c4(X1,X2,X3))). % 16.31/16.61 cnf(i_0_62, plain, (X1=comb_app(combK,X2)|~ap_contractE_c1(X1,X3,X2))). % 16.31/16.61 cnf(i_0_55, plain, (member(comb_app(X1,X2),comb)|~member(X2,comb)|~member(X1,comb))). % 16.31/16.61 cnf(i_0_76, plain, (member(pair(X1,X2),X3)|~trans(X3)|~member(pair(X4,X2),X3)|~member(pair(X1,X4),X3))). % 16.31/16.61 cnf(i_0_63, plain, (member(ap_contractE_sk1p(X1,X2,X3),comb)|~ap_contractE_c2(X1,X2,X3))). % 16.31/16.61 cnf(i_0_64, plain, (member(ap_contractE_sk1q(X1,X2,X3),comb)|~ap_contractE_c2(X1,X2,X3))). % 16.31/16.61 cnf(i_0_73, plain, (comb_app(X1,ap_contractE_sk3q(X1,X2,X3))=X3|~ap_contractE_c4(X1,X2,X3))). % 16.31/16.61 cnf(i_0_70, plain, (comb_app(ap_contractE_sk2q(X1,X2,X3),X2)=X3|~ap_contractE_c3(X1,X2,X3))). % 16.31/16.61 cnf(i_0_71, plain, (member(pair(X1,ap_contractE_sk3q(X2,X1,X3)),contract)|~ap_contractE_c4(X2,X1,X3))). % 16.31/16.61 cnf(i_0_68, plain, (member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)|~ap_contractE_c3(X1,X2,X3))). % 16.31/16.61 cnf(i_0_57, plain, (member(pair(comb_app(comb_app(combK,X1),X2),X1),contract)|~member(X2,comb)|~member(X1,comb))). % 16.31/16.61 cnf(i_0_79, plain, (member(pair(comb_app(comb_app(combK,X1),X2),X3),rtrancl(contract))|~member(pair(X1,X3),rtrancl(contract))|~member(X2,comb)|~member(X1,comb))). % 16.31/16.61 cnf(i_0_82, plain, (member(pair(comb_app(X1,X2),X3),rtrancl(contract))|~member(pair(comb_app(X1,X4),X3),rtrancl(contract))|~member(pair(X2,X4),contract)|~member(X1,comb))). % 16.31/16.61 cnf(i_0_81, plain, (member(pair(comb_app(X1,X2),X3),rtrancl(contract))|~member(pair(comb_app(X4,X2),X3),rtrancl(contract))|~member(pair(X1,X4),contract)|~member(X2,comb))). % 16.31/16.61 cnf(i_0_59, 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))). % 16.31/16.61 cnf(i_0_67, 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))). % 16.31/16.61 cnf(i_0_66, 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))). % 16.31/16.61 cnf(i_0_58, 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))). % 16.31/16.61 cnf(i_0_80, plain, (member(pair(comb_app(comb_app(comb_app(combS,X1),X2),X3),X4),rtrancl(contract))|~member(pair(comb_app(comb_app(X1,X3),comb_app(X2,X3)),X4),rtrancl(contract))|~member(X3,comb)|~member(X2,comb)|~member(X1,comb))). % 16.31/16.61 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 16.31/16.61 # Begin printing tableau % 16.31/16.61 # Found 8 steps % 16.31/16.61 cnf(i_0_88, negated_conjecture, (~member(pair(comb_app(p,r),comb_app(z,r)),rtrancl(contract))), inference(start_rule)). % 16.31/16.61 cnf(i_0_89, plain, (~member(pair(comb_app(p,r),comb_app(z,r)),rtrancl(contract))), inference(extension_rule, [i_0_76])). % 16.31/16.61 cnf(i_0_118, plain, (~trans(rtrancl(contract))), inference(closure_rule, [i_0_77])). % 16.31/16.61 cnf(i_0_120, plain, (~member(pair(comb_app(p,r),comb_app(y,r)),rtrancl(contract))), inference(closure_rule, [i_0_87])). % 16.31/16.61 cnf(i_0_119, plain, (~member(pair(comb_app(y,r),comb_app(z,r)),rtrancl(contract))), inference(extension_rule, [i_0_81])). % 16.31/16.61 cnf(i_0_662982, plain, (~member(pair(y,z),contract)), inference(closure_rule, [i_0_86])). % 16.31/16.61 cnf(i_0_662983, plain, (~member(r,comb)), inference(closure_rule, [i_0_83])). % 16.31/16.61 cnf(i_0_662981, plain, (~member(pair(comb_app(z,r),comb_app(z,r)),rtrancl(contract))), inference(etableau_closure_rule, [i_0_662981, ...])). % 16.31/16.61 # End printing tableau % 16.31/16.61 # SZS output end % 16.31/16.61 # Branches closed with saturation will be marked with an "s" % 16.31/16.63 # Child (29533) has found a proof. % 16.31/16.63 % 16.31/16.63 # Proof search is over... % 16.31/16.63 # Freeing feature tree %------------------------------------------------------------------------------