%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HWV005-1 : TPTP v8.1.0. Released v2.1.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 : Sat Jul 16 14:10:27 EDT 2022 % Result : Unsatisfiable 0.19s 0.42s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : HWV005-1 : TPTP v8.1.0. Released v2.1.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 16 23:35:57 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 42 Number of unprocessed: 42 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # 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 # 42 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 10 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 32 extension rule candidate clauses % 0.12/0.37 # 10 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 3 % 0.19/0.42 # There were 4 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 4 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 4 successful branch saturations after the branch. % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_77, hypothesis, (type(h,halfadder))). % 0.19/0.42 cnf(i_0_78, hypothesis, (value(in(n1,h),n1))). % 0.19/0.42 cnf(i_0_79, hypothesis, (value(in(n2,h),n0))). % 0.19/0.42 cnf(i_0_80, hypothesis, (value(out(s,h),n0))). % 0.19/0.42 cnf(i_0_81, hypothesis, (value(out(c,h),n0))). % 0.19/0.42 cnf(i_0_82, negated_conjecture, (~mode(and1(h),abnormal))). % 0.19/0.42 cnf(i_0_83, negated_conjecture, (~mode(not1(h),abnormal))). % 0.19/0.42 cnf(i_0_84, negated_conjecture, (~mode(or1(h),abnormal))). % 0.19/0.42 cnf(i_0_46, plain, (~equal_value(n0,n1))). % 0.19/0.42 cnf(i_0_47, plain, (~equal_value(n1,n0))). % 0.19/0.42 cnf(i_0_48, plain, (~mode(X1,ok)|~mode(X1,abnormal))). % 0.19/0.42 cnf(i_0_64, plain, (type(and1(X1),and)|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_65, plain, (type(and2(X1),and)|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_66, plain, (type(not1(X1),not)|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_67, plain, (type(or1(X1),or)|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_49, plain, (mode(X1,abnormal)|mode(X1,ok)|~type(X1,X2))). % 0.19/0.42 cnf(i_0_43, plain, (value(X1,X2)|~value(X3,X2)|~connection(X3,X1))). % 0.19/0.42 cnf(i_0_44, plain, (value(X1,X2)|~value(X3,X2)|~connection(X1,X3))). % 0.19/0.42 cnf(i_0_45, plain, (equal_value(X1,X2)|~value(X3,X2)|~value(X3,X1))). % 0.19/0.42 cnf(i_0_58, plain, (value(in(n1,X1),n0)|~type(X1,or)|~mode(X1,ok)|~value(out(n1,X1),n0))). % 0.19/0.42 cnf(i_0_63, plain, (value(in(n1,X1),n0)|~type(X1,not)|~mode(X1,ok)|~value(out(n1,X1),n1))). % 0.19/0.42 cnf(i_0_53, plain, (value(in(n1,X1),n1)|~type(X1,and)|~mode(X1,ok)|~value(out(n1,X1),n1))). % 0.19/0.42 cnf(i_0_68, plain, (connection(in(n1,X1),in(n1,or1(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_69, plain, (connection(in(n2,X1),in(n2,or1(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_72, plain, (connection(out(s,X1),out(n1,and1(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_76, plain, (connection(out(n1,not1(X1)),in(n2,and1(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_74, plain, (connection(out(n1,or1(X1)),in(n1,and1(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_70, plain, (connection(in(n1,X1),in(n1,and2(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_71, plain, (connection(in(n2,X1),in(n2,and2(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_62, plain, (value(in(n1,X1),n1)|~type(X1,not)|~mode(X1,ok)|~value(out(n1,X1),n0))). % 0.19/0.42 cnf(i_0_59, plain, (value(in(n2,X1),n0)|~type(X1,or)|~mode(X1,ok)|~value(out(n1,X1),n0))). % 0.19/0.42 cnf(i_0_54, plain, (value(in(n2,X1),n1)|~type(X1,and)|~mode(X1,ok)|~value(out(n1,X1),n1))). % 0.19/0.42 cnf(i_0_61, plain, (value(out(n1,X1),n0)|~type(X1,not)|~mode(X1,ok)|~value(in(n1,X1),n1))). % 0.19/0.42 cnf(i_0_73, plain, (connection(out(c,X1),out(n1,and2(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_75, plain, (connection(out(n1,and2(X1)),in(n1,not1(X1)))|~type(X1,halfadder))). % 0.19/0.42 cnf(i_0_60, plain, (value(out(n1,X1),n1)|~type(X1,not)|~mode(X1,ok)|~value(in(n1,X1),n0))). % 0.19/0.42 cnf(i_0_50, plain, (value(out(n1,X1),n0)|~type(X1,and)|~mode(X1,ok)|~value(in(X2,X1),n0))). % 0.19/0.42 cnf(i_0_55, plain, (value(out(n1,X1),n1)|~type(X1,or)|~mode(X1,ok)|~value(in(X2,X1),n1))). % 0.19/0.42 cnf(i_0_52, plain, (value(in(n2,X1),n0)|value(in(n1,X1),n0)|~type(X1,and)|~mode(X1,ok)|~value(out(n1,X1),n0))). % 0.19/0.42 cnf(i_0_57, plain, (value(in(n2,X1),n1)|value(in(n1,X1),n1)|~type(X1,or)|~mode(X1,ok)|~value(out(n1,X1),n1))). % 0.19/0.42 cnf(i_0_56, plain, (value(out(n1,X1),n0)|~type(X1,or)|~mode(X1,ok)|~value(in(n1,X1),n0)|~value(in(n2,X1),n0))). % 0.19/0.42 cnf(i_0_51, plain, (value(out(n1,X1),n1)|~type(X1,and)|~mode(X1,ok)|~value(in(n1,X1),n1)|~value(in(n2,X1),n1))). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 7 steps % 0.19/0.42 cnf(i_0_82, negated_conjecture, (~mode(and1(h),abnormal)), inference(start_rule)). % 0.19/0.42 cnf(i_0_87, plain, (~mode(and1(h),abnormal)), inference(extension_rule, [i_0_49])). % 0.19/0.42 cnf(i_0_299, plain, (mode(and1(h),ok)), inference(extension_rule, [i_0_58])). % 0.19/0.42 cnf(i_0_300, plain, (~type(and1(h),X4)), inference(etableau_closure_rule, [i_0_300, ...])). % 0.19/0.42 cnf(i_0_410, plain, (value(in(n1,and1(h)),n0)), inference(etableau_closure_rule, [i_0_410, ...])). % 0.19/0.42 cnf(i_0_411, plain, (~type(and1(h),or)), inference(etableau_closure_rule, [i_0_411, ...])). % 0.19/0.42 cnf(i_0_413, plain, (~value(out(n1,and1(h)),n0)), inference(etableau_closure_rule, [i_0_413, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.19/0.42 # We now have 3 tableaux to operate on % 0.19/0.42 # Found closed tableau during pool population. % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------