%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET009-1 : TPTP v8.1.0. Released v1.0.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 : n017.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 00:56:05 EDT 2022 % Result : Unsatisfiable 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SET009-1 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n017.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sun Jul 10 07:29:47 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 16 Number of unprocessed: 16 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 16 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 4 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 12 extension rule candidate clauses % 0.13/0.38 # 4 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.39 # There were 2 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 2 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 2 successful branch saturations after the branch. % 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_29, hypothesis, (subset(d,a))). % 0.13/0.39 cnf(i_0_31, hypothesis, (difference(b,d,bDd))). % 0.13/0.39 cnf(i_0_30, hypothesis, (difference(b,a,bDa))). % 0.13/0.39 cnf(i_0_32, negated_conjecture, (~subset(bDa,bDd))). % 0.13/0.39 cnf(i_0_21, plain, (subset(X1,X2)|~equal_sets(X2,X1))). % 0.13/0.39 cnf(i_0_20, plain, (subset(X1,X2)|~equal_sets(X1,X2))). % 0.13/0.39 cnf(i_0_22, plain, (equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1))). % 0.13/0.39 cnf(i_0_19, plain, (subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2))). % 0.13/0.39 cnf(i_0_24, plain, (~difference(X1,X2,X3)|~member(X4,X3)|~member(X4,X2))). % 0.13/0.39 cnf(i_0_17, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.13/0.39 cnf(i_0_23, plain, (member(X1,X2)|~difference(X2,X3,X4)|~member(X1,X4))). % 0.13/0.39 cnf(i_0_18, plain, (subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1))). % 0.13/0.39 cnf(i_0_25, plain, (member(X1,X2)|member(X1,X3)|~difference(X4,X2,X3)|~member(X1,X4))). % 0.13/0.39 cnf(i_0_27, plain, (difference(X1,X2,X3)|member(k(X1,X2,X3),X3)|~member(k(X1,X2,X3),X2))). % 0.13/0.39 cnf(i_0_26, plain, (difference(X1,X2,X3)|member(k(X1,X2,X3),X1)|member(k(X1,X2,X3),X3))). % 0.13/0.39 cnf(i_0_28, plain, (difference(X1,X2,X3)|member(k(X1,X2,X3),X2)|~member(k(X1,X2,X3),X3)|~member(k(X1,X2,X3),X1))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 5 steps % 0.13/0.39 cnf(i_0_32, negated_conjecture, (~subset(bDa,bDd)), inference(start_rule)). % 0.13/0.39 cnf(i_0_33, plain, (~subset(bDa,bDd)), inference(extension_rule, [i_0_18])). % 0.13/0.39 cnf(i_0_53, plain, (member(member_of_1_not_of_2(bDa,bDd),bDa)), inference(extension_rule, [i_0_24])). % 0.13/0.39 cnf(i_0_78, plain, (~member(member_of_1_not_of_2(bDa,bDd),bDa)), inference(closure_rule, [i_0_53])). % 0.13/0.39 cnf(i_0_77, plain, (~difference(X6,bDa,bDa)), inference(etableau_closure_rule, [i_0_77, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 5 tableaux to operate on % 0.13/0.39 # Found closed tableau during pool population. % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------