%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV252-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 : 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 : Wed Jul 20 18:19:50 EDT 2022 % Result : Unsatisfiable 0.20s 0.55s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV252-2 : TPTP v8.1.0. Released v3.2.0. % 0.07/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 : Wed Jun 15 01:46:49 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I % 0.12/0.36 # and selection function SelectCQArEqLast. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 19 Number of unprocessed: 19 % 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 # 19 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 # 11 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 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 8 tableaux to operate on % 0.20/0.55 # There were 2 total branch saturation attempts. % 0.20/0.55 # There were 0 of these attempts blocked. % 0.20/0.55 # There were 0 deferred branch saturation attempts. % 0.20/0.55 # There were 0 free duplicated saturations. % 0.20/0.55 # There were 2 total successful branch saturations. % 0.20/0.55 # There were 0 successful branch saturations in interreduction. % 0.20/0.55 # There were 0 successful branch saturations on the branch. % 0.20/0.55 # There were 2 successful branch saturations after the branch. % 0.20/0.55 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.55 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.55 # Begin clausification derivation % 0.20/0.55 % 0.20/0.55 # End clausification derivation % 0.20/0.55 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.55 cnf(i_0_22, plain, (c_Message_Oanalz(c_Message_Oparts(X1))=c_Message_Oparts(X1))). % 0.20/0.55 cnf(i_0_24, plain, (c_Message_Oparts(c_Message_Oanalz(X1))=c_Message_Oparts(X1))). % 0.20/0.55 cnf(i_0_38, plain, (class_Orderings_Oorder(tc_set(X1)))). % 0.20/0.55 cnf(i_0_20, negated_conjecture, (c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg))). % 0.20/0.55 cnf(i_0_27, plain, (c_Message_Oparts(c_Message_Osynth(X1))=c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg))). % 0.20/0.55 cnf(i_0_30, plain, (c_union(X1,c_minus(X2,X1,tc_set(X3)),X3)=c_union(X1,X2,X3))). % 0.20/0.55 cnf(i_0_29, plain, (c_union(c_minus(X1,X2,tc_set(X3)),X2,X3)=c_union(X1,X2,X3))). % 0.20/0.55 cnf(i_0_21, negated_conjecture, (~c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)))). % 0.20/0.55 cnf(i_0_28, plain, (c_lessequals(X1,X1,X2)|~class_Orderings_Oorder(X2))). % 0.20/0.55 cnf(i_0_26, plain, (c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))|~c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)))). % 0.20/0.55 cnf(i_0_34, plain, (c_in(X1,X2,X3)|~c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3)))). % 0.20/0.55 cnf(i_0_23, plain, (c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))|~c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)))). % 0.20/0.55 cnf(i_0_25, plain, (c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))|~c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)))). % 0.20/0.55 cnf(i_0_35, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_lessequals(c_insert(X4,X1,X3),X2,tc_set(X3)))). % 0.20/0.55 cnf(i_0_32, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)))). % 0.20/0.55 cnf(i_0_31, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_lessequals(c_union(X1,X4,X3),X2,tc_set(X3)))). % 0.20/0.55 cnf(i_0_37, plain, (X1=X2|~c_lessequals(X2,X1,tc_set(X3))|~c_lessequals(X1,X2,tc_set(X3)))). % 0.20/0.55 cnf(i_0_36, plain, (c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))|~c_lessequals(X2,X4,tc_set(X3))|~c_in(X1,X4,X3))). % 0.20/0.55 cnf(i_0_33, plain, (c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))|~c_lessequals(X1,X4,tc_set(X3))|~c_lessequals(X2,X4,tc_set(X3)))). % 0.20/0.55 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.55 # Begin printing tableau % 0.20/0.55 # Found 9 steps % 0.20/0.55 cnf(i_0_20, negated_conjecture, (c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg)), inference(start_rule)). % 0.20/0.55 cnf(i_0_40, plain, (c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg)), inference(extension_rule, [i_0_36])). % 0.20/0.55 cnf(i_0_85, plain, (c_lessequals(c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg))), inference(extension_rule, [i_0_36])). % 0.20/0.55 cnf(i_0_112, plain, (~c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg)), inference(closure_rule, [i_0_20])). % 0.20/0.55 cnf(i_0_110, plain, (c_lessequals(c_insert(v_X,c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg))), inference(extension_rule, [i_0_37])). % 0.20/0.55 cnf(i_0_86, plain, (~c_lessequals(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg))), inference(extension_rule, [i_0_28])). % 0.20/0.55 cnf(i_0_136, plain, (~class_Orderings_Oorder(tc_set(tc_Message_Omsg))), inference(closure_rule, [i_0_38])). % 0.20/0.55 cnf(i_0_132, plain, (c_Message_Osynth(c_Message_Oanalz(v_H))=c_insert(v_X,c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),tc_Message_Omsg)), inference(etableau_closure_rule, [i_0_132, ...])). % 0.20/0.55 cnf(i_0_134, plain, (~c_lessequals(c_Message_Osynth(c_Message_Oanalz(v_H)),c_insert(v_X,c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),tc_Message_Omsg),tc_set(tc_Message_Omsg))), inference(etableau_closure_rule, [i_0_134, ...])). % 0.20/0.55 # End printing tableau % 0.20/0.55 # SZS output end % 0.20/0.55 # Branches closed with saturation will be marked with an "s" % 0.20/0.55 # Child (27406) has found a proof. % 0.20/0.55 % 0.20/0.55 # Proof search is over... % 0.20/0.55 # Freeing feature tree %------------------------------------------------------------------------------