%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL100-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:53 EDT 2022 % Result : Unsatisfiable 0.18s 0.42s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : COL100-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 06:38: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: 17 Number of unprocessed: 17 % 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.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 17 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 2 conjectures. % 0.12/0.36 # There are 2 start rule candidates: % 0.12/0.36 # Found 8 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 2 start rule tableaux created. % 0.12/0.36 # 9 extension rule candidate clauses % 0.12/0.36 # 8 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 9 tableaux to operate on % 0.18/0.42 # There were 2 total branch saturation attempts. % 0.18/0.42 # There were 0 of these attempts blocked. % 0.18/0.42 # There were 0 deferred branch saturation attempts. % 0.18/0.42 # There were 0 free duplicated saturations. % 0.18/0.42 # There were 2 total successful branch saturations. % 0.18/0.42 # There were 0 successful branch saturations in interreduction. % 0.18/0.42 # There were 0 successful branch saturations on the branch. % 0.18/0.42 # There were 2 successful branch saturations after the branch. % 0.18/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.42 # Begin clausification derivation % 0.18/0.42 % 0.18/0.42 # End clausification derivation % 0.18/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.42 cnf(i_0_35, negated_conjecture, (member(pair(y,yp),trancl(r)))). % 0.18/0.42 cnf(i_0_30, hypothesis, (diamond(r))). % 0.18/0.42 cnf(i_0_32, hypothesis, (member(pair(ya,z),r))). % 0.18/0.42 cnf(i_0_31, hypothesis, (member(pair(y,ya),trancl(r)))). % 0.18/0.42 cnf(i_0_26, plain, (trans(trancl(X1)))). % 0.18/0.42 cnf(i_0_19, plain, (combK!=combS)). % 0.18/0.42 cnf(i_0_20, plain, (comb_app(X1,X2)!=combK)). % 0.18/0.42 cnf(i_0_21, plain, (comb_app(X1,X2)!=combS)). % 0.18/0.42 cnf(i_0_23, plain, (X1=X2|comb_app(X3,X1)!=comb_app(X4,X2))). % 0.18/0.42 cnf(i_0_22, plain, (X1=X2|comb_app(X1,X3)!=comb_app(X2,X4))). % 0.18/0.42 cnf(i_0_36, negated_conjecture, (~member(pair(z,X1),trancl(r))|~member(pair(yp,X1),trancl(r)))). % 0.18/0.42 cnf(i_0_25, plain, (member(pair(X1,X2),trancl(X3))|~member(pair(X1,X2),X3))). % 0.18/0.42 cnf(i_0_33, hypothesis, (member(pair(ya,sk1(X1)),trancl(r))|~member(pair(y,X1),trancl(r)))). % 0.18/0.42 cnf(i_0_34, hypothesis, (member(pair(X1,sk1(X1)),trancl(r))|~member(pair(y,X1),trancl(r)))). % 0.18/0.42 cnf(i_0_27, plain, (member(pair(X1,X2),X3)|~trans(X3)|~member(pair(X4,X2),X3)|~member(pair(X1,X4),X3))). % 0.18/0.42 cnf(i_0_29, plain, (member(pair(X1,diamond_strip_lemmaD_sk1(X2,X1,X3,X4)),X4)|~diamond(X4)|~member(pair(X2,X1),trancl(X4))|~member(pair(X2,X3),X4))). % 0.18/0.42 cnf(i_0_28, plain, (member(pair(X1,diamond_strip_lemmaD_sk1(X2,X3,X1,X4)),trancl(X4))|~diamond(X4)|~member(pair(X2,X3),trancl(X4))|~member(pair(X2,X1),X4))). % 0.18/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.42 # Begin printing tableau % 0.18/0.42 # Found 8 steps % 0.18/0.42 cnf(i_0_36, negated_conjecture, (~member(pair(z,sk1(yp)),trancl(r))|~member(pair(yp,sk1(yp)),trancl(r))), inference(start_rule)). % 0.18/0.42 cnf(i_0_38, plain, (~member(pair(yp,sk1(yp)),trancl(r))), inference(extension_rule, [i_0_34])). % 0.18/0.42 cnf(i_0_73, plain, (~member(pair(y,yp),trancl(r))), inference(closure_rule, [i_0_35])). % 0.18/0.42 cnf(i_0_37, plain, (~member(pair(z,sk1(yp)),trancl(r))), inference(extension_rule, [i_0_27])). % 0.18/0.42 cnf(i_0_721, plain, (~trans(trancl(r))), inference(closure_rule, [i_0_26])). % 0.18/0.42 cnf(i_0_722, plain, (~member(pair(yp,sk1(yp)),trancl(r))), inference(closure_rule, [i_0_38])). % 0.18/0.42 cnf(i_0_723, plain, (~member(pair(z,yp),trancl(r))), inference(extension_rule, [i_0_25])). % 0.18/0.42 cnf(i_0_743, plain, (~member(pair(z,yp),r)), inference(etableau_closure_rule, [i_0_743, ...])). % 0.18/0.42 # End printing tableau % 0.18/0.42 # SZS output end % 0.18/0.42 # Branches closed with saturation will be marked with an "s" % 0.18/0.42 # Child (20186) has found a proof. % 0.18/0.42 % 0.18/0.42 # Proof search is over... % 0.18/0.42 # Freeing feature tree %------------------------------------------------------------------------------