%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV261-2 : TPTP v8.1.0. Released v3.2.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 : n019.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 : Wed Jul 20 18:19:55 EDT 2022 % Result : Unsatisfiable 0.20s 0.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV261-2 : TPTP v8.1.0. Released v3.2.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 : n019.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 : Wed Jun 15 03:07:09 EDT 2022 % 0.14/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 10 Number of unprocessed: 10 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.40 # The folding up rule is enabled... % 0.20/0.40 # Local unification is enabled... % 0.20/0.40 # Any saturation attempts will use folding labels... % 0.20/0.40 # 10 beginning clauses after preprocessing and clausification % 0.20/0.40 # Creating start rules for all 2 conjectures. % 0.20/0.40 # There are 2 start rule candidates: % 0.20/0.40 # Found 3 unit axioms. % 0.20/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.40 # 2 start rule tableaux created. % 0.20/0.40 # 7 extension rule candidate clauses % 0.20/0.40 # 3 unit axiom clauses % 0.20/0.40 % 0.20/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_11, negated_conjecture, (c_in(v_X,v_G,tc_Message_Omsg))). % 0.20/0.40 cnf(i_0_13, plain, (c_lessequals(c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),tc_set(tc_Message_Omsg)))). % 0.20/0.40 cnf(i_0_12, negated_conjecture, (~c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)))). % 0.20/0.40 cnf(i_0_14, plain, (c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))|~c_lessequals(X1,X2,tc_set(tc_Message_Omsg)))). % 0.20/0.40 cnf(i_0_19, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))). % 0.20/0.40 cnf(i_0_18, plain, (c_lessequals(X1,X2,tc_set(X3))|c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3))). % 0.20/0.40 cnf(i_0_15, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X3,X4))). % 0.20/0.40 cnf(i_0_17, plain, (X1=X2|c_in(X1,X3,X4)|~c_in(X1,c_insert(X2,X3,X4),X4))). % 0.20/0.40 cnf(i_0_16, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X2,X4))). % 0.20/0.40 cnf(i_0_20, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_lessequals(X1,X4,tc_set(X3))|~c_lessequals(X4,X2,tc_set(X3)))). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 4 steps % 0.20/0.40 cnf(i_0_11, negated_conjecture, (c_in(v_X,v_G,tc_Message_Omsg)), inference(start_rule)). % 0.20/0.40 cnf(i_0_22, plain, (c_in(v_X,v_G,tc_Message_Omsg)), inference(extension_rule, [i_0_16])). % 0.20/0.40 cnf(i_0_50, plain, (c_in(v_X,c_union(v_G,X10,tc_Message_Omsg),tc_Message_Omsg)), inference(extension_rule, [i_0_15])). % 0.20/0.40 cnf(i_0_61, plain, (c_in(v_X,c_union(X6,c_union(v_G,X10,tc_Message_Omsg),tc_Message_Omsg),tc_Message_Omsg)), inference(etableau_closure_rule, [i_0_61, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.20/0.40 # We now have 5 tableaux to operate on % 0.20/0.40 # Found closed tableau during pool population. % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------