%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET839-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 : Tue Jul 19 01:03:06 EDT 2022 % Result : Unsatisfiable 0.12s 0.35s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SET839-2 : TPTP v8.1.0. Released v3.2.0. % 0.10/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 : Sun Jul 10 14:20:01 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.35 # No SInE strategy applied % 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.35 # % 0.12/0.35 # Presaturation interreduction done % 0.12/0.35 # Number of axioms: 6 Number of unprocessed: 6 % 0.12/0.35 # Tableaux proof search. % 0.12/0.35 # APR header successfully linked. % 0.12/0.35 # Hello from C++ % 0.12/0.35 # The folding up rule is enabled... % 0.12/0.35 # Local unification is enabled... % 0.12/0.35 # Any saturation attempts will use folding labels... % 0.12/0.35 # 6 beginning clauses after preprocessing and clausification % 0.12/0.35 # Creating start rules for all 2 conjectures. % 0.12/0.35 # There are 2 start rule candidates: % 0.12/0.35 # Found 2 unit axioms. % 0.12/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.35 # 2 start rule tableaux created. % 0.12/0.35 # 4 extension rule candidate clauses % 0.12/0.35 # 2 unit axiom clauses % 0.12/0.35 % 0.12/0.35 # Requested 8, 32 cores available to the main process. % 0.12/0.35 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.35 # There were 2 total branch saturation attempts. % 0.12/0.35 # There were 0 of these attempts blocked. % 0.12/0.35 # There were 0 deferred branch saturation attempts. % 0.12/0.35 # There were 0 free duplicated saturations. % 0.12/0.35 # There were 2 total successful branch saturations. % 0.12/0.35 # There were 0 successful branch saturations in interreduction. % 0.12/0.35 # There were 0 successful branch saturations on the branch. % 0.12/0.35 # There were 2 successful branch saturations after the branch. % 0.12/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.35 # Begin clausification derivation % 0.12/0.35 % 0.12/0.35 # End clausification derivation % 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.35 cnf(i_0_9, plain, (c_in(X1,c_insert(X1,X2,X3),X3))). % 0.12/0.35 cnf(i_0_7, negated_conjecture, (~c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))))). % 0.12/0.35 cnf(i_0_8, negated_conjecture, (c_lessequals(X1,X2,tc_set(t_a))|~c_in(X2,v_S,tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))). % 0.12/0.35 cnf(i_0_12, plain, (X1=X2|~c_lessequals(X2,X1,tc_set(X3))|~c_lessequals(X1,X2,tc_set(X3)))). % 0.12/0.35 cnf(i_0_11, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))). % 0.12/0.35 cnf(i_0_10, plain, (c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)|c_lessequals(X1,X2,tc_set(X3)))). % 0.12/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.35 # Begin printing tableau % 0.12/0.35 # Found 5 steps % 0.12/0.35 cnf(i_0_7, negated_conjecture, (~c_lessequals(v_S,c_insert(X6,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a)))), inference(start_rule)). % 0.12/0.35 cnf(i_0_16, plain, (~c_lessequals(v_S,c_insert(X6,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_10])). % 0.12/0.35 cnf(i_0_52, plain, (c_in(c_Main_OsubsetI__1(v_S,c_insert(X6,c_emptyset,tc_set(t_a)),tc_set(t_a)),v_S,tc_set(t_a))), inference(extension_rule, [i_0_8])). % 0.12/0.35 cnf(i_0_65, plain, (~c_in(c_Main_OsubsetI__1(v_S,c_insert(X6,c_emptyset,tc_set(t_a)),tc_set(t_a)),v_S,tc_set(t_a))), inference(closure_rule, [i_0_52])). % 0.12/0.35 cnf(i_0_64, plain, (c_lessequals(c_Main_OsubsetI__1(v_S,c_insert(X6,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_Main_OsubsetI__1(v_S,c_insert(X6,c_emptyset,tc_set(t_a)),tc_set(t_a)),tc_set(t_a))), inference(etableau_closure_rule, [i_0_64, ...])). % 0.12/0.35 # End printing tableau % 0.12/0.35 # SZS output end % 0.12/0.35 # Branches closed with saturation will be marked with an "s" % 0.12/0.35 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.12/0.35 # We now have 7 tableaux to operate on % 0.12/0.35 # Found closed tableau during pool population. % 0.12/0.35 # Proof search is over... % 0.12/0.35 # Freeing feature tree %------------------------------------------------------------------------------