%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ064-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 : 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 : Mon Jul 18 18:11:05 EDT 2022 % Result : Unsatisfiable 5.69s 1.14s % Output : CNFRefutation 5.69s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : PUZ064-2 : TPTP v8.1.0. Released v3.2.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 : 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 : Sat May 28 22:41:43 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 28 Number of unprocessed: 28 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 28 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 6 conjectures. % 0.19/0.37 # There are 6 start rule candidates: % 0.19/0.37 # Found 20 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 6 start rule tableaux created. % 0.19/0.37 # 8 extension rule candidate clauses % 0.19/0.37 # 20 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 6 % 0.19/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 10 tableaux to operate on % 5.69/1.14 # There were 2 total branch saturation attempts. % 5.69/1.14 # There were 0 of these attempts blocked. % 5.69/1.14 # There were 0 deferred branch saturation attempts. % 5.69/1.14 # There were 0 free duplicated saturations. % 5.69/1.14 # There were 2 total successful branch saturations. % 5.69/1.14 # There were 0 successful branch saturations in interreduction. % 5.69/1.14 # There were 0 successful branch saturations on the branch. % 5.69/1.14 # There were 2 successful branch saturations after the branch. % 5.69/1.14 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.69/1.14 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.69/1.14 # Begin clausification derivation % 5.69/1.14 % 5.69/1.14 # End clausification derivation % 5.69/1.14 # Begin listing active clauses obtained from FOF to CNF conversion % 5.69/1.14 cnf(i_0_30, negated_conjecture, (c_in(v_a,v_A,tc_set(t_a)))). % 5.69/1.14 cnf(i_0_32, negated_conjecture, (c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)))). % 5.69/1.14 cnf(i_0_39, plain, (c_uminus(c_UNIV,tc_set(X1))=c_emptyset)). % 5.69/1.14 cnf(i_0_49, plain, (c_union(X1,c_emptyset,X2)=X1)). % 5.69/1.14 cnf(i_0_46, plain, (c_union(X1,X1,X2)=X1)). % 5.69/1.14 cnf(i_0_58, plain, (c_lessequals(X1,X1,tc_set(X2)))). % 5.69/1.14 cnf(i_0_48, plain, (c_union(c_emptyset,X1,X2)=X1)). % 5.69/1.14 cnf(i_0_45, plain, (c_union(c_UNIV,X1,X2)=c_UNIV)). % 5.69/1.14 cnf(i_0_55, plain, (c_lessequals(c_emptyset,X1,tc_set(X2)))). % 5.69/1.14 cnf(i_0_53, plain, (c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2))=X1)). % 5.69/1.14 cnf(i_0_44, plain, (c_union(X1,c_minus(X2,X1,tc_set(X3)),X3)=c_union(X1,X2,X3))). % 5.69/1.14 cnf(i_0_43, plain, (c_union(c_minus(X1,X2,tc_set(X3)),X2,X3)=c_union(X1,X2,X3))). % 5.69/1.14 cnf(i_0_47, plain, (c_union(c_union(X1,X2,X3),X4,X3)=c_union(X1,c_union(X2,X4,X3),X3))). % 5.69/1.14 cnf(i_0_40, plain, (c_Relation_OImage(c_Relation_Odiag(X1,X2),X3,X2,X2)=c_minus(X1,c_uminus(X3,tc_set(X2)),tc_set(X2)))). % 5.69/1.14 cnf(i_0_31, negated_conjecture, (c_minus(v_a,c_uminus(v_t,tc_set(t_a)),tc_set(t_a))=c_emptyset)). % 5.69/1.14 cnf(i_0_38, plain, (c_uminus(c_minus(X1,X2,tc_set(X3)),tc_set(X3))=c_union(c_uminus(X1,tc_set(X3)),X2,X3))). % 5.69/1.14 cnf(i_0_41, plain, (c_minus(c_UNIV,c_uminus(X1,tc_set(X2)),tc_set(X2))=X1)). % 5.69/1.14 cnf(i_0_33, negated_conjecture, (c_minus(c_union(v_a,v_t,t_a),c_uminus(v_u,tc_set(t_a)),tc_set(t_a))=c_emptyset)). % 5.69/1.14 cnf(i_0_54, plain, (~c_in(X1,c_emptyset,X2))). % 5.69/1.14 cnf(i_0_34, negated_conjecture, (~c_in(c_union(v_a,c_union(v_t,v_u,t_a),t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)))). % 5.69/1.14 cnf(i_0_57, plain, (X1=X2|~c_lessequals(X2,X1,tc_set(X3))|~c_lessequals(X1,X2,tc_set(X3)))). % 5.69/1.14 cnf(i_0_51, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)))). % 5.69/1.14 cnf(i_0_50, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_lessequals(c_union(X1,X4,X3),X2,tc_set(X3)))). % 5.69/1.14 cnf(i_0_56, plain, (c_lessequals(X1,X2,tc_set(X3))|c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3))). % 5.69/1.14 cnf(i_0_35, negated_conjecture, (c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a))|c_minus(v_t,c_uminus(v_u,tc_set(t_a)),tc_set(t_a))!=c_emptyset)). % 5.69/1.14 cnf(i_0_42, plain, (c_in(X1,X2,X3)|~c_in(X1,c_minus(X4,c_uminus(X2,tc_set(X3)),tc_set(X3)),X3))). % 5.69/1.14 cnf(i_0_52, 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)))). % 5.69/1.14 cnf(i_0_36, plain, (c_in(c_union(X1,X2,X3),c_Mutil_Otiling(X4,X3),tc_set(X3))|c_minus(X1,c_uminus(X2,tc_set(X3)),tc_set(X3))!=c_emptyset|~c_in(X2,c_Mutil_Otiling(X4,X3),tc_set(X3))|~c_in(X1,X4,tc_set(X3)))). % 5.69/1.14 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.69/1.14 # Begin printing tableau % 5.69/1.14 # Found 7 steps % 5.69/1.14 cnf(i_0_30, negated_conjecture, (c_in(v_a,v_A,tc_set(t_a))), inference(start_rule)). % 5.69/1.14 cnf(i_0_65, plain, (c_in(v_a,v_A,tc_set(t_a))), inference(extension_rule, [i_0_36])). % 5.69/1.14 cnf(i_0_200, plain, (c_in(c_union(v_a,c_union(v_t,v_u,t_a),t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a))), inference(closure_rule, [i_0_34])). % 5.69/1.14 cnf(i_0_201, plain, (c_minus(v_a,c_uminus(c_union(v_t,v_u,t_a),tc_set(t_a)),tc_set(t_a))!=c_emptyset), inference(extension_rule, [i_0_57])). % 5.69/1.14 cnf(i_0_205, plain, (~c_lessequals(c_emptyset,c_minus(v_a,c_uminus(c_union(v_t,v_u,t_a),tc_set(t_a)),tc_set(t_a)),tc_set(X6))), inference(closure_rule, [i_0_55])). % 5.69/1.14 cnf(i_0_202, plain, (~c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a))), inference(etableau_closure_rule, [i_0_202, ...])). % 5.69/1.14 cnf(i_0_206, plain, (~c_lessequals(c_minus(v_a,c_uminus(c_union(v_t,v_u,t_a),tc_set(t_a)),tc_set(t_a)),c_emptyset,tc_set(X6))), inference(etableau_closure_rule, [i_0_206, ...])). % 5.69/1.14 # End printing tableau % 5.69/1.14 # SZS output end % 5.69/1.14 # Branches closed with saturation will be marked with an "s" % 5.69/1.14 # Child (25134) has found a proof. % 5.69/1.14 % 5.69/1.14 # Proof search is over... % 5.69/1.14 # Freeing feature tree %------------------------------------------------------------------------------