%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.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 : n020.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 : Sun Jul 17 16:43:30 EDT 2022 % Result : Unsatisfiable 0.18s 0.41s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.0. % 0.03/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 : n020.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 : Mon May 30 02:58:54 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: 12 Number of unprocessed: 12 % 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 # 12 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 12 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 0 extension rule candidate clauses % 0.12/0.36 # 12 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 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 16 tableaux to operate on % 0.18/0.41 # There were 1 total branch saturation attempts. % 0.18/0.41 # There were 0 of these attempts blocked. % 0.18/0.41 # There were 0 deferred branch saturation attempts. % 0.18/0.41 # There were 0 free duplicated saturations. % 0.18/0.41 # There were 1 total successful branch saturations. % 0.18/0.41 # There were 0 successful branch saturations in interreduction. % 0.18/0.41 # There were 0 successful branch saturations on the branch. % 0.18/0.41 # There were 1 successful branch saturations after the branch. % 0.18/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # Begin clausification derivation % 0.18/0.41 % 0.18/0.41 # End clausification derivation % 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.41 cnf(i_0_22, plain, (f(u1,u3)=b)). % 0.18/0.41 cnf(i_0_23, plain, (f(uu,uu)=v)). % 0.18/0.41 cnf(i_0_14, plain, (f(n1,n1)=n2)). % 0.18/0.41 cnf(i_0_15, plain, (f(n2,n1)=n3)). % 0.18/0.41 cnf(i_0_16, plain, (f(n2,n2)=u)). % 0.18/0.41 cnf(i_0_17, plain, (f(u,n1)=u1)). % 0.18/0.41 cnf(i_0_18, plain, (f(u,n2)=u2)). % 0.18/0.41 cnf(i_0_19, plain, (f(u,n3)=u3)). % 0.18/0.41 cnf(i_0_20, plain, (f(u,u)=uu)). % 0.18/0.41 cnf(i_0_21, plain, (f(f(n3,n2),u2)=a)). % 0.18/0.41 cnf(i_0_13, plain, (f(f(X1,X2),f(X1,X3))=f(X1,f(X2,X3)))). % 0.18/0.41 cnf(i_0_24, negated_conjecture, (f(a,v)!=f(b,v))). % 0.18/0.41 cnf(i_0_26, plain, (X4=X4)). % 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.41 # Begin printing tableau % 0.18/0.41 # Found 6 steps % 0.18/0.41 cnf(i_0_16, plain, (f(n2,n2)=u), inference(start_rule)). % 0.18/0.41 cnf(i_0_35, plain, (f(n2,n2)=u), inference(extension_rule, [i_0_29])). % 0.18/0.41 cnf(i_0_60, plain, (f(n2,n2)!=u), inference(closure_rule, [i_0_16])). % 0.18/0.41 cnf(i_0_58, plain, (f(n2,n2)=f(n2,n2)), inference(extension_rule, [i_0_30])). % 0.18/0.41 cnf(i_0_67, plain, (f(u1,u3)!=b), inference(closure_rule, [i_0_22])). % 0.18/0.41 cnf(i_0_65, plain, (f(f(n2,n2),f(u1,u3))=f(f(n2,n2),b)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.18/0.41 # End printing tableau % 0.18/0.41 # SZS output end % 0.18/0.41 # Branches closed with saturation will be marked with an "s" % 0.18/0.41 # Child (1964) has found a proof. % 0.18/0.41 % 0.18/0.41 # Proof search is over... % 0.18/0.41 # Freeing feature tree %------------------------------------------------------------------------------